A given grammar is called ambiguous if – McqOptions

MCQOPTIONS

1.	A given grammar is called ambiguous if
A.	two or more productions have the same non-terminal on the left-hand side
B.	a derivation tree has more than one associated sentence
C.	there is a sentence with more than one derivation tree corresponding to it
D.	brackets are not present in the grammar
Answer» D. brackets are not present in the grammar

Discussion

No Comment Found

Related MCQs

A given grammar is called ambiguous if
Consider the grammarS → AbBaCc | εA → aAb | baB → bBC | cbC → cCa |acFind the First ( ) of S
______ is a data structure that holds information about identifiers.
Given the grammars → T * S | TT → U + T | UU → a | bWhich of the following statements is wrong?
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during
Consider the following statements.I. Symbol table is accessed only during lexical analysis and syntax analysis.II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment.III. Errors violating the condition ‘any variable must be declared before its use’ are detected during syntax analysis.Which of the above statements is/are TRUE?
Consider the following grammar:P → xQRSQ → yz |zR → w | εS → yWhat is FOLLOW(Q)?
Consider the grammar defined by the following production rules, with two operators ∗ and +S → T * PT → U|T * UP → Q + P|QQ → IdU → IdWhich one of the following is TRUE?
Consider the following ANSI C program:int main() {Integer x;return 0;}Which one of the following phases in a seven-phase C compiler will throw an error?
Incremental-Compiler is a compiler