Register

Test by Bikram | Compiler Design | Test 1 | Question: 4

• retagged by
578 views

1 Answer

Best answer
2 2 votes

A top down parser is called LL parser because it parses the input from Left to right, and constructs a Leftmost derivation of the sentence.

C is correct 

• selected by
Voting & Accepting an answer helps improve the community
Answer:
← Previous · Test by Bikram | Com...Next → · Test by Bikram | Com...
← Previous in category · Test by Bikram | Com...Next in category → · Test by Bikram | Com...
Position:
Show:

Related questions

3 3 votes
0 0 answers
1.3k
1.3k views
Bikram asked Nov 25, 2016
1,291 views
Test by Bikram | Compiler Design | Test 1 | Question: 27
$\textbf{goto}$ function of LR class of grammar is represented as:Deterministic Finite Automata transitionsNon-deterministic Finite Automata transitionsPDA transitionsPar...
3 3 votes
1 answers 1 answer
1.1k
1.1k views
Bikram asked Nov 25, 2016
1,108 views
Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
3 3 votes
1 answers 1 answer
610
610 views
Bikram asked Nov 25, 2016
610 views
Test by Bikram | Compiler Design | Test 1 | Question: 23
Which one of the following statements is TRUE?SLR parser has more states than LALR parser.LALR parser has more states than Canonical LR.Canonical LR has fewer states than...
3 3 votes
1 answers 1 answer
2.5k
2.5k views
Bikram asked Nov 25, 2016
2,490 views
Test by Bikram | Compiler Design | Test 1 | Question: 21
Which one of the following can be handled by predictive parsers?Left recursionLeft factorsAmbiguityNon-determinism