Alex Rivera | Logout

Are there such a thing as LL(0) parsers?

Asked 2011-03-09T23:51:32.227
32


I saw a question somewhere asking the difference between LL(0) and LR(0) parsers. Is there such a thing as LL(0) parsers? If so, how do they parse without looking at any token?

parsing compiler-theory
Edit
Report

1 Answer

3

The k in LR(k) refers to the number of lookahead tokens. You always use at least one token in order to determine the action to perform. The Wikipedia page page has some more information on this.

Intuitively, the extra lookahead symbols let you make reduction choices with more information, so they allow larger classes of grammars to be expressed without conflicts.

answered 2011-03-09T23:57:29.823

Your Answer