1. A grammar for which two distinct parse trees are possible for the same string

Question

1. A grammar for which two distinct parse trees are possible for the same string is considered to be ambiguous.??

True

?False

2. The lexical structure of a programming language is the structure of its tokens, or words.

??True

?False

3. Predictive parsing allows tokens that begin optional parts of the syntax to also appear after the optional part.??

True

?False

4. Recursive-descent parsers turn the nonterminals into a group of mutually recursive procedures whose actions are based on the right-hand side of the BNFs.??

True

?False

5. Names can be reused within nested blocks by associating each declaration with a level number and an offset.

??True

?False

6. A translator

Explanation / Answer

1 True

2 True

3 false

4 true

6 True

5 True

6 True

7 false

8 True

9 True

10 false

11 true

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.