Register

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

• retagged by
484 views
2 votes
2 votes

$\textbf{goto}$ function of LR class of grammar is represented as:

  1. Deterministic Finite Automata transitions
  2. Non-deterministic Finite Automata transitions
  3. PDA transitions
  4. Parsing table
• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
Bikram asked Nov 25, 2016
475 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$ ... $E \rightarrow TE' , \ \ T \rightarrow FT' , \ \ F \rightarrow (E) \mid id$
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...
User Avatar
2 votes
2 votes
1 answer
2
Bikram asked Nov 25, 2016
313 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 SLR parser. Both SLR and LALR parsers have the same number of states.
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...
User Avatar
3 votes
3 votes
1 answer
3
Bikram asked Nov 25, 2016
1,050 views
Test by Bikram | Compiler Design | Test 1 | Question: 21
Which one of the following can be handled by predictive parsers? Left recursion Left factors Ambiguity Non-determinism
Which one of the following can be handled by predictive parsers?Left recursionLeft factorsAmbiguityNon-determinism
User Avatar
Link Copied!