Top  Previous  Next

Glossary > LL(k)-grammar


A grammar is called LL(k) (= from left to right with left canonical derivation and a look-ahead of k symbols deterministic recognizable), if a top down analysis can decide by the next k symbols, how to continue.

Especially a grammar is LL(1), if one token suffices for this decision.




This page belongs to the TextTransformer Documentation

Home  Content  German