Related articles |
---|
Recursive Descent Parsers and YACC melling@psuvax1.cs.psu.edu (1990-11-15) |
Re: Recursive Descent Parsers and YACC pardo@cs.washington.edu (1990-11-16) |
Re: Recursive Descent Parsers and YACC grimlok@hubcap.clemson.edu (1990-11-16) |
Re: Recursive Descent Parsers and YACC Bruce.Hoult@actrix.co.nz (1990-11-18) |
Re: Recursive Descent Parsers and YACC dave@labtam.labtam.oz.au (1990-11-20) |
Re: Recursive Descent Parsers and YACC hankd@ecn.purdue.edu (1990-11-17) |
Re: Recursive Descent Parsers and YACC henry@zoo.toronto.edu (1990-11-17) |
Re: Recursive Descent Parsers and YACC mailrus!sharkey!hela!iti.org!dhw@uunet.UU.NETid AA (1990-11-20) |
Recursive Descent Parsers and YACC grosch@gmdka.uucp (Josef Grosch) (1990-11-22) |
Re: Recursive Descent Parsers and YACC grimlok@hubcap.clemson.edu (1990-11-23) |
Recursive Descent Parsers and YACC jsp@milton.u.washington.edu (Jeff Prothero) (1990-11-23) |
Re: Recursive Descent Parsers and YACC melling@psuvax1.cs.psu.edu (1990-11-26) |
[2 later articles] |
Newsgroups: | comp.compilers |
From: | hankd@ecn.purdue.edu (Hank Dietz) |
Summary: | Speed about 2-3x LL vs. LR |
Keywords: | parse, yacc, design, question |
Organization: | Purdue University Engineering Computer Network |
References: | <F7p?bk63@cs.psu.edu> |
Date: | Sat, 17 Nov 90 12:59:15 -0500 |
In article <F7p?bk63@cs.psu.edu> melling@psuvax1.cs.psu.edu (Michael D Mellinger) writes:
>Can someone give me an estimate on how much faster parsing can be made by
>writing a recursive-descent parser instead of using Yacc and Lex? ...
PCCTS (the Purdue Compiler-Construction Tool Set) builds LL(k) parsers
which average about 2-3x as fast as YACC's parsers. The primary
difference between them is that LL stack management can be implemented
directly with machine instructions on most machines, whereas LR stack
handling requires an interpreter... hence the 2-3x difference (for
example, it was about 2x for Pascal).
-hankd
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.