Related articles |
---|
Precedence-modification parsing jlilley@empathy.com (John Lilley) (1997-06-30) |
From: | John Lilley <jlilley@empathy.com> |
Newsgroups: | comp.compilers |
Date: | 30 Jun 1997 00:11:33 -0400 |
Organization: | Nerds for Hire, Inc. |
Keywords: | parse, question |
Hi,
I've been trying to find some information about "precedence
modification" parsing, as it applies to recursive-descent or LL
parsers. My understanding is that this speeds up the parse by
eliminating the very-deep rule nesting required to build operator
precedence into the rules. Any pointers to URLs, books, etc would be
appreciated.
john lilley
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.