As discussed in Section 4.3, the algorithm in Figure 4.4 could use left or right-recursion to transform a repeated sequence of symbols into standard grammar form. A production of the form A→A α is said to be left recursive. Similarly, a production of the form A →ß A is said to be right recursive. Show that any grammar that contains left- and right-recursive rules for the same LHS nonterminal must be ambiguous.
Figure 4.4
