|SUMMARY: Constant folding in the parser firstname.lastname@example.org (1992-08-12)|
|From:||email@example.com (Jeremy Fitzhardinge)|
|Organization:||Softway Pty Ltd|
|Date:||Wed, 12 Aug 1992 09:04:23 GMT|
|Summary:||It's best not to|
A week ago or so, I asked whether a non-ambigious grammar can be
constructed to eliminate constant expressions without explicit semantic
analysis of the parse tree.
The most popular answer was "Keep semantic analysis away from the parser",
and do the constant elimination as the tree is constructed. This can be
generalized to putting off such optimisations until the tree is completely
built, so that other transformations can be done.
John R. Levine <firstname.lastname@example.org>
email@example.com (Tim Pierce)
firstname.lastname@example.org.COM (Kurt Guntheroth)
"Jorge Tapia Jopia" <email@example.com>
firstname.lastname@example.org (Jens Hansson)
email@example.com (Taed Nelson)
firstname.lastname@example.org ph:+61 2 698 2322-x122 fax:+61 2 699 9174
Return to the
Search the comp.compilers archives again.