LL Parser - Constructing An LL(k) Parsing Table

Constructing An LL(k) Parsing Table

Until the mid 1990s, it was widely believed that LL(k) parsing (for k > 1) was impractical, since the parser table would have exponential size in k in the worst case. This perception changed gradually after the release of the PCCTS around 1992, when it was demonstrated that many programming languages can be parsed efficiently by an LL(k) parser without triggering the worst-case behavior of the parser. Moreover, in certain cases LL parsing is feasible even with unlimited lookahead. By contrast, traditional parser generators like yacc use LALR(1) parser tables to construct a restricted LR parser with a fixed one-token lookahead.

Read more about this topic:  LL Parser

Famous quotes containing the words constructing and/or table:

    The very hope of experimental philosophy, its expectation of constructing the sciences into a true philosophy of nature, is based on induction, or, if you please, the a priori presumption, that physical causation is universal; that the constitution of nature is written in its actual manifestations, and needs only to be deciphered by experimental and inductive research; that it is not a latent invisible writing, to be brought out by the magic of mental anticipation or metaphysical mediation.
    Chauncey Wright (1830–1875)

    The best thing about Sassy Seats is that grandmothers cannot figure out how they work and are in constant fear of the child’s falling. This often makes them forget to comment on other aspects of the child’s development, like why he is not yet talking or is still wearing diapers. Some grandmothers will spend an entire meal peering beneath the table and saying, “Is that thing steady?” rather than, “Have you had a doctor look at that left hand?”
    Anna Quindlen (20th century)