| Related articles |
|---|
| Java and recursive decent parsing.. limpus@immortalnet.com.au (Raymond Limpus) (2001-04-12) |
| Re: Java and recursive decent parsing.. chief@bandits.org (John Fremlin) (2001-04-14) |
| From: | "Raymond Limpus" <limpus@immortalnet.com.au> |
| Newsgroups: | comp.compilers |
| Date: | 12 Apr 2001 02:44:59 -0400 |
| Organization: | @Home Network |
| Keywords: | Java, LL(1), question |
| Posted-Date: | 12 Apr 2001 02:44:59 EDT |
Is it possible to parse Java source using a recursive decent parser? I
know the grammar isn't LL(1) but there are only a couple of parts that
aren't (stemming form C/C++ background) and surely you could create
some 'hacks' in the code to deal with these. The grammars I have seen
have been LALR(1) but by looking at it it does seem you could parse it
using recursive decent with a couple of special cases. Is this the
case?
Thanks,
Ray.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.