| Related articles |
|---|
| [3 earlier articles] |
| Re: Parsing a simple BASIC language christl@fmi.uni-passau.de (2001-04-12) |
| Re: Parsing a simple BASIC language paul.dunn4@ntlworld.com (Dunny) (2001-04-12) |
| Re: Parsing a simple BASIC language barry_j_kelly@hotmail.com (Barry Kelly) (2001-04-14) |
| Re: Parsing a simple BASIC language marcov@toad.stack.nl (2001-04-18) |
| Re: Parsing a simple BASIC language michael@moria.de (2001-04-18) |
| Re: Parsing a simple BASIC language paul.dunn4@ntlworld.com (Dunny) (2001-04-22) |
| Re: Parsing a simple BASIC language barry_j_kelly@hotmail.com (Barry Kelly) (2001-04-22) |
| From: | "Barry Kelly" <barry_j_kelly@hotmail.com> |
| Newsgroups: | comp.compilers |
| Date: | 22 Apr 2001 23:52:41 -0400 |
| Organization: | Ireland On-Line Customer |
| References: | 01-04-014 01-04-039 01-04-074 01-04-097 01-04-110 |
| Keywords: | Basic, parse |
| Posted-Date: | 22 Apr 2001 23:52:41 EDT |
> If you like Parser10, have a look at
>
> http://www.stack.nl/~marcov/symbolic.zip
I don't particularly <g>; it has a horrible parsing speed (about 50
times slower than simple recursive descent), but a fairly efficient
evaluation method (a three-address code variant), while Marcov's code
uses an RPN stack machine.
> P.s. is Object Pascal LL(1)?
Strictly, no. With context, you can manage it.
-- Barry
Return to the
comp.compilers page.
Search the
comp.compilers archives again.