LL Grammars: Useful Transformations
Generaly: CFG are stronger that LL grammars
The family of languages generated by CFGs
The family of languages generated by LL grammars
Illustration:
• Some CFGs can be converted to equivalent LL grammars
Basic conversions:
1) Factorization
2) Left recursion replacement
Ì
Note: A rule of the form A ® Ax, where A Î N, x Î (N È T)* is called a left recursive rule.
11/57