---

%PDF-1.2 %���� 10 0 obj << /Length 11 0 R >> stream 2 J BT /F1 16 Tf 245.5 741 TD 0 Tc 0 Tw (LL GRAMMARS)Tj /F1 14 Tf -173 -31 TD (LL)Tj /F2 14 Tf 18 0 TD 0.168 Tc ( grammars are a subset of BNF \(context-free\) grammars. )Tj /F1 14 Tf 334 0 TD 0 Tc (LL)Tj /F2 14 Tf 18 0 TD 0.169 Tc ( grammars)Tj -370 -16 TD 0.058 Tc (impose restrictions on BNF grammars to simplify parsing. )Tj /F1 14 Tf 337 0 TD 0 Tc (LL)Tj /F2 14 Tf 18 0 TD 0.138 Tc ( grammars may be)Tj -355 -16 TD 0 Tc (implemented in top-down predictive parsing algorithms with complexity O\(n\),)Tj 0 -16 TD 0.093 Tc (where n is the length of the input string. This includes both recursive-descent and)Tj T* 0.065 Tc (table-driven algorithms based on syntax graphs. )Tj /F1 14 Tf 282 0 TD 0 Tc (LL)Tj /F2 14 Tf 18 0 TD 0.121 Tc ( parsers operate by scanning)Tj -300 -16 TD 0.094 Tc (the input from )Tj /F1 14 Tf 85 0 TD (L)Tj /F2 14 Tf 9 0 TD (eft to right and producing a )Tj /F1 14 Tf 159 0 TD (L)Tj /F2 14 Tf 9 0 TD 0 Tc (eftmost derivation of the input)Tj -262 -16 TD (string.)Tj 0 -32 TD 0.108 Tc (The conditions for an )Tj /F1 14 Tf 126 0 TD 0 Tc (LL)Tj /F2 14 Tf 18 0 TD 0.138 Tc ( grammar are stated in terms of the )Tj /F1 14 Tf 204 0 TD -0.247 Tc (FIRST)Tj /F2 14 Tf 40 0 TD 0 Tc ( and)Tj /F1 14 Tf -388 -16 TD -0.168 Tc (FOLLOW)Tj /F2 14 Tf 62 0 TD 0.033 Tc ( sets applied to the grammar rules:)Tj -62 -32 TD 0 Tc (1.)Tj /F3 14 Tf 11 0 TD ( )Tj /F2 14 Tf 7 0 TD 0.253 Tc (If

---