This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 2) For a given parse tree T, is it true that only one derivation corresponds to it? 3) What is wrong with the following statement: I can prove G is an ambiguous grammar by showing that G has two leftmost derivations. 4) Why would it be bad if we built a compiler for a programming language PL using an ambiguous grammar PLG for PL? 5) What is the definition of an inherently ambiguous context-free language L?...
View Full Document
- Fall '07
- Formal grammar, Context-free grammar, parse tree, corresponding parse tree