This preview shows page 1. Sign up to view the full content.
Unformatted text preview: works through the input 7. Write a recursive descent parser for a small grammar 8. Show a leftmost and rightmost derivation for a sentence in a grammar 9. Be able to tell if a grammar is ambiguous 10. Remove left recursion and factor a grammar so that it is predictable....
View Full Document
- Spring '08