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

>>[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
%V 21
%N 7
%D July 1986
%P 145-151
%X * Partial evaluation of the table interpreter with resepct to each
element of the table (though not described as such).
  * On a VAX-like machine, 40,000 to 500,000 lines per minute. On an
80286, 37,000 to 240,000 lines per minute.
  * FSM converted to assembly language, 2-4X increase in table size.


;-D on ( Parsetial Evaluation ) Pardo


--

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