Exercise 2.2.2: What language is generated by the following grammars? In each case justify your answer. a) S0S1 | 01 b) S → + SS SS | a c) S →>> S(S) S € d) S → a Sb S b SaS | € e) S → a S + S SS | S* |(S)

Rewrite the grammar so that it is not ambiguous any more.  <S> -> <A> <A> -> <A> + <A> | <id> <id> -> a | b | c

Why might we want (or need) different grammars for different parsing algorithms?

how you would add the symbol "-" minus to the alphabet of the LR parsing table means "HOW" you would do it , what would you use as a template? How would you walk through the process and would you have to add to the grammar as well? if so, what would you add?

Write a BNF grammar describing the syntax of BNF; i.e., define the syntax of BNF itself using BNF. Use a pair of single quotes to use meta symbols like | and -> as terminal symbols, e.g., '|' and '->'. You may assume that non-terminals such as <identifier> and <special-symbol> are already defined.