1. |
A grammar that produces more than one parse tree for some sentence is called __________
|
||||||||
Answer:
Option (a) |
2. |
Is given grammar is Ambiguous? S-> SS+ | SS* | a
|
||||||||
Answer:
Option (b) |
3. |
Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.
|
||||||||
Answer:
Option (a) |
4. |
The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called
|
||||||||
Answer:
Option (c) |
5. |
Which of the following statements is false?
|
||||||||
Answer:
Option (a) |
6. |
What are the stages in the compilation process? Select one:
|
||||||||
Answer:
Option (c) |
7. |
YACC is a:
|
||||||||
Answer:
Option (b) |
8. |
Given grammar S –> (L) | a L –> L, S | S Which of the input recognized by the grammar:
|
||||||||
Answer:
Option (d) |
9. |
The bottom-up parsing method is also called
|
||||||||
Answer:
Option (a) |
10. |
The most general phrase structured grammar
|
||||||||
Answer:
Option (a) |