| Related articles |
|---|
| GCC for BCPL tc@cs.bath.ac.uk (Tom Crick) (2004-11-20) |
| RE: GCC for BCPL tom@kednos.com (Tom Linden) (2004-11-26) |
| RE: GCC for BCPL tc@cs.bath.ac.uk (Tom Crick) (2004-11-28) |
| From: | "Tom Linden" <tom@kednos.com> |
| Newsgroups: | comp.compilers |
| Date: | 26 Nov 2004 22:39:04 -0500 |
| Organization: | Compilers Central |
| References: | 04-11-082 |
| Keywords: | parse, GCC |
| Posted-Date: | 26 Nov 2004 22:39:04 EST |
It might be interesting to explain why you abandoned recursive
descent, and what the reasons for doing so.
>Recently work has been spent on validating the BCPL grammar, but this
>has forced a re-evaluation of using Bison to create the parser. The
>original BCPL parsers were recursive-descent and certain language
>features (particularly the optional semicolon problem) seem to point
>towards their use now.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.