Interested in working on a parser generator

Interested in working on a parser generator

[John Stracke]

The FSF's help-wanted page says that a parser generator that generates
Scheme would be a welcome utility, for creating Foo-->Scheme
translators.  I'd be interested in working on such a project; is anybody
working on one already?

I should mention that, although I have substantial experience using
parser generators at my day job, my Scheme experience is minimal (though
I have been using elisp for a long time :-).  I fully expect to have to
throw away my first attempt.

-- 
/===============================================================\
|John Stracke        | http://www.thibault.org |HTML OK         |
|Francois Thibault   |==========================================|
|East Kingdom        |"Where's your sense of adventure?" "Hiding|
|francis@thibault.org|under the bed."                           |
\===============================================================/
My medieval art for sale: http://www.thibault.org/store/


_______________________________________________
Guile-devel mailing list
Guile-devel@gnu.org
http://mail.gnu.org/mailman/listinfo/guile-devel

Re: Interested in working on a parser generator

[Lynn Winebarger]

John Stracke wrote:
> The FSF's help-wanted page says that a parser generator that generates
> Scheme would be a welcome utility, for creating Foo-->Scheme
> translators.  I'd be interested in working on such a project; is anybody
> working on one already?

     I wrote the core of a scanner generator this weekend that I could
donate.  It produces a DFA as a big letrec with tail-recursive functions
for the states.
     Plus it allows you to insert actions with arbitrary scheme code and gives you
access to the fail and success continuations, even after conversion
to a dfa (though it does mean the search is breadth-first instead
of depth-first, so you would have to keep track of things with that
in mind).
     It doesn't have much in the way of error-handling, and contains
some Chezisms (generic ports and record-case).  Also, it only handles
pre-parsed regular expressions.
     Still, I'm pretty stoked about it.  What do I need to do to submit it?

     I also have some macros to convert a (pre-parsed) regular expression
to a big closure that just does backtracking, if that's of any interest.

Lynn




_______________________________________________
Guile-devel mailing list
Guile-devel@gnu.org
http://mail.gnu.org/mailman/listinfo/guile-devel

Re: Interested in working on a parser generator

[Clinton Ebadi]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On Tuesday 02 September 2003 19:26, Lynn Winebarger wrote:
> John Stracke wrote:
> > The FSF's help-wanted page says that a parser generator that generates
> > Scheme would be a welcome utility, for creating Foo-->Scheme
> > translators.  I'd be interested in working on such a project; is anybody
> > working on one already?
>
>      I wrote the core of a scanner generator this weekend that I could
> donate.  It produces a DFA as a big letrec with tail-recursive functions
> for the states.
>      Plus it allows you to insert actions with arbitrary scheme code and
> gives you access to the fail and success continuations, even after
> conversion to a dfa (though it does mean the search is breadth-first
> instead
> of depth-first, so you would have to keep track of things with that
> in mind).
>      It doesn't have much in the way of error-handling, and contains
> some Chezisms (generic ports and record-case).  Also, it only handles
> pre-parsed regular expressions.
>      Still, I'm pretty stoked about it.  What do I need to do to submit it?

I think that you should publish the code somewhere so that everyone can take a 
look. The main Guile developers seem to all be really busy right now (rlb has 
a job, Marius is working on some grad school work, etc.) so it could be a 
while before anyone would get you the papers to assign copyright to the FSF.

Having the code available would also help others to make it work with Guile 
(e.g. put it into a module, say (parser dfa), and then rewrite the Chez 
specific code to use the Guile equivalents). I may be able to help with that 
(and am entirely willing to assign copyright to the FSF), but I don't know 
much about parsers or Chez.
- -- 
http://unknownlamer.org
AIM:unknownlamer IRC:unknown_lamer@freenode#hprog
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.2 (GNU/Linux)

iD8DBQE/Vn7XdgGh8PQDV0sRAov7AKCNL0avC9N1PgkUAkpFWfK5jjTYHgCcC0re
rVLuNIdYvb+zF4hSmPjccCI=
=TQco
-----END PGP SIGNATURE-----


_______________________________________________
Guile-devel mailing list
Guile-devel@gnu.org
http://mail.gnu.org/mailman/listinfo/guile-devel

Re: Interested in working on a parser generator

[Rob Browning]

Clinton Ebadi <clinton@unknownlamer.org> writes:

> so it could be a while before anyone would get you the papers to
> assign copyright to the FSF.

This, at least, can be handled independently by emailing the right
people.  I believe the address is probably assign@gnu.org.

-- 
Rob Browning
rlb @defaultvalue.org and @debian.org; previously @cs.utexas.edu
GPG starting 2002-11-03 = 14DD 432F AE39 534D B592  F9A0 25C8 D377 8C7E 73A4


_______________________________________________
Guile-devel mailing list
Guile-devel@gnu.org
http://mail.gnu.org/mailman/listinfo/guile-devel