retagged by
228 views

1 Answer

Best answer
2 votes
2 votes

Semantic Analyzer:-It verifies the parse tree, whether it’s meaningful or not. It furthermore produces a verified parse tree.It also does type checking, Label checking and Flow control checking.

B is Correct.

selected by
Answer:

Related questions

2 votes
2 votes
2 answers
1
Bikram asked Nov 25, 2016
663 views
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above
3 votes
3 votes
1 answer
2
Bikram asked Nov 25, 2016
263 views
Which grammar causes recursive-descent parser to go into infinite loop?LL(1)Left recursive grammarRight recursive grammarGrammar with left factors
3 votes
3 votes
1 answer
3
2 votes
2 votes
0 answers
4
Bikram asked Nov 25, 2016
444 views
$\textbf{goto}$ function of LR class of grammar is represented as:Deterministic Finite Automata transitionsNon-deterministic Finite Automata transitionsPDA transitionsPar...