Re: A Dylan parser-generator.

To: info-dylan@ai.mit.edu
Subject: Re: A Dylan parser-generator.
From: "Michael T. Richter" <mtr@igs.net>
Date: Wed, 19 Apr 2000 15:00:03 -0400 (EDT)
Organization: Bell Solutions
References: <1YjL4.102$K_2.184@198.235.216.4> <brucehoult-2004000328060001@bruce.bgh> <ZKmL4.912$K_2.46@198.235.216.4> <38FDFCF2.5F570409@cup.hp.com>
Reply-To: "Michael T. Richter" <mtr@ottawa.com>
Xref: traf.lcs.mit.edu comp.lang.dylan:11871

Eric Gouriou <eric_gouriou@cup.hp.com> wrote in message
38FDFCF2.5F570409@cup.hp.com">news:38FDFCF2.5F570409@cup.hp.com...
>> 1) LALR(1), LL(1), LL(k), pred-LL(k) (i.e. backtracking),
>> something completely different?

> I guess LALR(1) but not 100% sure.

Does it generate billions of tables holding integer values?  Or does it
generate recursive-descent function calls?

>> 2) Is it portable Dylan?  (I.e. could I port it without a huge
>> amount of difficulty to FO, or does it rely on Gwydion internals?)

> I have a faster parsergen for FD if you are interested.

I'm very interested.  :-)

References:

A Dylan parser-generator.

From: "Michael T. Richter" <mtr@igs.net>

Re: A Dylan parser-generator.

From: brucehoult@pobox.com (Bruce Hoult)

Re: A Dylan parser-generator.

From: "Michael T. Richter" <mtr@igs.net>

Re: A Dylan parser-generator.

From: Eric Gouriou <eric_gouriou@cup.hp.com>