lex/yacc vs parser combinators

Erik de Castro Lopo <nospam@mega-nerd.com>
4 Nov 2005 13:58:45 -0500

          From comp.compilers
Related articles
lex/yacc vs parser combinators nospam@mega-nerd.com (Erik de Castro Lopo) (2005-11-04)
Re: lex/yacc vs parser combinators schmitz@i3s.unice.fr (Sylvain Schmitz) (2005-11-08)
| List of all articles for this month |
From: Erik de Castro Lopo <nospam@mega-nerd.com>
Newsgroups: comp.compilers
Date: 4 Nov 2005 13:58:45 -0500
Organization: Erik Secret Conspiracy Labs
Keywords: question, tools
Posted-Date: 04 Nov 2005 13:58:45 EST

Hi all,


I have used and feel quite comfortable with lex/yacc (both
the GNU versions and ocamllex/ocamlyacc) but find that
once you have a grammar defined it still takes quite a bit
of iterative tweaking to then create an AST from within the
grammar's productions.


I have also recently become aware of parser combinators
in particular Parsec for Haskell but also the one in
the Pagoda Core Foundation library for Ocaml.


So, is there anyone who has used both lex/yacc and parser
combinators who is willing to comment on their relative
merits?


TIA,
Erik


--
+-----------------------------------------------------------+
    Erik de Castro Lopo

Post a followup to this message

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