Java Reference
In-Depth Information
25. Section 5.9.4 describes an error recovery method that relies on dynam-
ically constructed sets of Follow symbols. Compare these sets with the
Follow information computed for full LL(1) in Exercise 23.
26. As pointed out in Section 5.6, there are some languages that are not LL( k )
for any k . In other words, given k tokens of lookahead, where k can be
chosen as any integer constant, there is no top-down parsing technique
that can recognize the language.
Using the alphabet
, devise such a language and explain why no
LL( k ) grammar exists for that language.
{ a , b }
Search WWH ::




Custom Search