Q. In which order are the children of any node ordered?

View solution

Q. Which among the following is the root of the parse tree?

View solution

Q. For the expression E*(E) where * and brackets are the operation, number of nodes in the respective parse tree are:

View solution

Q. The number of leaves in a parse tree with expression E*(E) where * and () are operators

View solution

Q. A grammar with more than one parse tree is called:

View solution

Q. __________ is the acyclic graphical representation of a grammar.

View solution

Q. Grammar is checked by which component of compiler

View solution

Q. A symbol X is ________ if there exists : S->* aXb

View solution

Q. A symbol X is called to be useful if and only if its is:

View solution

Q. Which of the following is false for a grammar G in Chomsky Normal Form:

View solution

Q. Given Checklist:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) Normal form for production is violated
Is it possible for the grammar G to be in CNF with the following checklisy ?

View solution

Q. State true or false:
Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1.

View solution

Q. If |w|>=2^h, then its parse tree’s height is at least _____

View solution

Q. If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________ structure of w.

View solution

Q. Which of the following are distinct to parse trees?

View solution

Q. Choose the correct option:
Statement: Unambiguity is the ideal structure of a language.

View solution

Q. Is the given statement correct?
Statement: The mere existence of several derivations is not an issue, its is the existence of several parse trees that ruins a grammar.

View solution