Problem
1. Give a context-free grammar to describe all strings with no more than two consecutive I's.
2. How many procedure calls are used by the recursive-descent parser to recognize a regular expression in terms of the number of concatenation, or, and closure operations and the number of parentheses?
3. Give the , next 1 and next 2 arrays that result from building the pattern-matching machine for the pattern ((A+B)+(C+D)*)*.