20.2. Grammars - Part 2 (W 2/3/16)¶
20.2.1. RP 2 part 1¶
Topics of the day:
- Infinite languages and recursion
- Ambiguous grammars
- Operator associativity
The review problem set for today contains four review problems, the first three of which refer to the same grammar.
This problem is about determining how many parse trees a given string has in a given grammar.
20.2.2. RP 2 part 2¶
This problem is again about determining how many parse trees a given string has in a given grammar.
20.2.3. RP 2 part 3¶
This problem is once more about determining how many parse trees a given string has in a given grammar.
20.2.4. RP 2 part 4¶
This problem will help you discover ambiguities in grammars as well as convince yourself that a grammar is not ambiguous.
