The Gateway to Computer Science Excellence
+27 votes

In a compiler, keywords of a language are recognized during

  1. parsing of the program
  2. the code generation
  3. the lexical analysis of the program
  4. dataflow analysis
in Compiler Design by Veteran (106k points)
edited by | 3.7k views

2 Answers

+43 votes
Best answer

Typically, the lexical analysis phase of compilation breaks the input text up into sequences of lexemes that each belongs to some particular token type that's useful in later analysis. Consequently, keywords are usually first recognized during lexical analysis in order to make parsing easier. Since parsers tend to be implemented by writing context-free grammars of tokens rather than of lexemes (that is, the category of the lexeme rather than the contents of the lexeme), it is significantly easier to build a parser when keywords are marked during lexing. Any identifier is also a token so it is recognized in lexical Analysis .
Hence, option C is True.
[email protected]

by Active (5.2k points)
edited by
Errors in keywords are realised in parsing .. right ??? Ex If I have typed "retrun" instead of "return" then lexical analysis phase will think that as identifier and send it to parser .... right ???

It is hard for a lexical analyzer to tell, without the aid of other components, that there is a source-code error. For instance, if the string fi is encountered for the first time in a C program in the context:

fi ( a == f(x) ) ...

a lexical analyzer cannot tell whether fi is a misspelling of the keyword if or an undeclared function identifier. Since fi is a valid lexeme for the token id, the lexical analyzer must return the token id to the parser and let some other phase of the compiler - probably the parser in this case - handle an error due to transposition of the letters.


lexical analyzer will treat fi as normal token because it does not match with any keyword of c .when syntax analyzer(parser) will ask for new token lexical analyzer​​​​​​​ will give this token with some id then parser will try to make parse tree using predefined rules(grammar ) of C language if it will not able to identify that what it is .then this will be reported to error handler about type of error and column and row no given by lexical analyzer​​​​​​​.

0 votes
answer - C
by Loyal (8.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,834 questions
57,838 answers
108,346 users