Register

NIELIT 2017 July Scientist B (CS) - Section B: 49

• retagged by
2,008 views

5 Answers

2 votes
2 votes
option C

In programming language, keywords, constants, identifiers, strings, numbers, operators and punctuations symbols can be considered as tokens in lexical analysing phase.
User Avatar
0 votes
0 votes
Lexical analysis is the first phase of a compiler. It takes the modified source code from language preprocessors that are written in the form of sentences. The lexical analyzer breaks these syntax into a series of tokens, by removing any white space or comments in the source code.

If the lexical analyzer finds a token invalid, it generates an error. The lexical analyzer works closely with the syntax analyzer. It reads character streams from the source code, checks for legal tokens, and passes the data to the syntax analyzer when it demands.

In programming language, keywords, constants, identifiers, strings, numbers, operators and punctuations symbols can be considered as tokens.
User Avatar
0 votes
0 votes
answer:- (c)

in a compiler keywords of a language are recognized during the lexical analysis of the program.
User Avatar
0 votes
0 votes
As lexical analyzer scans character by character through whole source program and according to maximum munch rule it identifies the keywords and set of tokens

So option is C
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
admin asked Mar 30, 2020
1,013 views
NIELIT 2017 July Scientist B (CS) - Section B: 47
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \to a)$ to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^n$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \...
User Avatar
0 votes
0 votes
1 answer
2
admin asked Mar 30, 2020
762 views
NIELIT 2017 July Scientist B (CS) - Section B: 57
A system program that combines the separately complied modules of a program into a form suitable for execution assembler linking loader cross compiler load and go
A system program that combines the separately complied modules of a program into a form suitable for executionassemblerlinking loadercross compilerload and go
User Avatar
0 votes
0 votes
0 answers
4
admin asked Mar 30, 2020
1,193 views
NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
User Avatar
Link Copied!