| Related articles |
|---|
| improving weak precedence fortes@mimosa.unice.fr (Jose Fortes) (1991-09-16) |
| Newsgroups: | comp.compilers |
| From: | Jose Fortes <fortes@mimosa.unice.fr> |
| Keywords: | parse, question |
| Organization: | Compilers Central |
| Date: | Mon, 16 Sep 91 15:21:37 GMT |
The weak precedence parsing technique for context-free grammars is
usually defined with the following restrictions:
1) empty rules are forbidden, and
2) somehow strong conditions are put on the similarity of right-hand
parts of grammar rules.
I am particularly interested in knowing about techniques that improve
weak precedence's parsing power by relaxing these two restrictions.
References are most welcome.
Jose Fortes
Laboratoire I3S
Sophia Antipolis
France
e-mail: fortes@mimosa.unice.fr
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.