Re: Generating a simple hand-coded like recursive descent parser

"Mr.E" <mr.waverlye@verizon.net>
11 Sep 2006 15:52:44 -0400

          From comp.compilers

Related articles
[10 earlier articles]
Re: Generating a simple hand-coded like recursive descent parser tommy.thorn@gmail.com (Tommy Thorn) (2006-09-10)
Re: Generating a simple hand-coded like recursive descent parser ArarghMail609@Arargh.com (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser mr.waverlye@verizon.net (Mr.E) (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser ArarghMail609@Arargh.com (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser mr.waverlye@verizon.net (Mr.E) (2006-09-11)
Re: Generating a simple hand-coded like recursive descent parser tommy.thorn@gmail.com (Tommy Thorn) (2006-09-12)
Re: Generating a simple hand-coded like recursive descent parser mr.waverlye@verizon.net (Mr.E) (2006-09-16)
Re: Generating a simple hand-coded like recursive descent parser tommy.thorn@gmail.com (Tommy Thorn) (2006-09-18)
The 30 min optimizing native code compiler [was: Generating a simple h tommy.thorn@gmail.com (Tommy Thorn) (2006-09-21)
Re: Generating a simple hand-coded like recursive descent parser DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-09-21)
Re: Generating a simple hand-coded like recursive descent parser chris.dollin@hp.com (Chris Dollin) (2006-09-22)
[30 later articles]
| List of all articles for this month |

From: "Mr.E" <mr.waverlye@verizon.net>
Newsgroups: comp.compilers
Date: 11 Sep 2006 15:52:44 -0400
Organization: Compilers Central
References: 06-09-02906-09-039 06-09-042
Keywords: parse

Tommy Thorn wrote:
> Mr.E wrote:
> > From what I've read, many compilers are grown and extended by using
> > their own language, I like that idea.
>
> Using the right language will teach you concepts that makes doing this
> so much easier. At the very minimum you need product (~ "struct") and
> sum (~ "union") types. In (classic) BASIC you'd have to simulate those
> making it a very unnatural and messy implementation.


Not attempting to be an apologist for BASIC but our fathers BASIC is
different from todays BASIC. Different dialects have emerged. Some
havent changed much and others are highly improved. The dialect I use
has records (~structs), unions, functions, pointers and much that is
available to a C programmer.


> PS: Here's a slightly compressed solution in C for the first half.


I will study your example and make good use of it.


Thank you very much for your input.




W.



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.