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) |
From: | Sylvain Schmitz <schmitz@i3s.unice.fr> |
Newsgroups: | comp.compilers |
Date: | 8 Nov 2005 23:34:05 -0500 |
Organization: | Compilers Central |
References: | 05-11-036 |
Keywords: | parse, tools |
Posted-Date: | 08 Nov 2005 23:34:05 EST |
Erik de Castro Lopo wrote:
> 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.
You might then find interest in programs assisting you during the
creation of the AST. Two come to my mind, and I'm sure there are many more:
* TreeCC <http://www.southern-storm.com.au/treecc.html>, and
* BNF Converter <http://www.cs.chalmers.se/~markus/BNFC/>.
--
Hope that helps,
Sylvain
Return to the
comp.compilers page.
Search the
comp.compilers archives again.