Re: LL(1) vs LALR(1) parsers

> From: pardo@cs.washington.edu (David Keppel)
>
  -------------------------------------------------------------------------------
>
> >>[Why recursive descent parsing?]
>
> ddean@cs.princeton.edu (Drew Dean) writes:
> >[Because it's faster.]
>
> %A Thomas J. Pennello
> %T Very Fast LR Parsing
> %J Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction;
> SIGPLAN Notices




@Article{horspool:90a,
    author = "R. N. Horspool and M. Whitney",
    title = "Even faster {LR} parsing",
    journal = SPE,
    volume = "20",
    number = "6",
    pages = "515--535",
    month = June,
    year = "1990",
}


--
Gordon V. Cormack CS Dept, University of Waterloo, Canada N2L 3G1
gvcormac@uwaterloo.ca http://cormack.uwaterloo.ca/~gvcormac


--

Return to the comp.compilers page.
Search the comp.compilers archives again.