|unyacc? email@example.com (Bakul Shah) (1994-11-11)|
|Re: unyacc? firstname.lastname@example.org (Virendra Kr. Mehta) (1994-11-14)|
|Re: unyacc? email@example.com (1994-12-03)|
|From:||Bakul Shah <firstname.lastname@example.org>|
|Keywords:||parse, tools, question|
|Date:||Fri, 11 Nov 1994 22:25:44 GMT|
A parser + tree generator produce a parse tree from input that is a valid
string in some specific input grammar. What I am looking for is a tool
that goes the other way; something that will take a parse tree and produce
a valid string of the same grammar (and for bonus points, pretty printed).
Even better, does anyone know of a program, sort of like a backwards yacc,
that will produce such an unparser? It seems to me that the same EBNF
specification can be used in some way to go the other way. This will make
it easier to write transformers that take a file, operate on it and spit
out the modified data in the same format. Among other things this allows
one to incre- mentally operate on or build structured data. Note that
such an editor may display this data in a form that looks very different
from the way it is stored in a file -- I am not looking for syntax
directed editors. Thanks for any pointers.
Return to the
Search the comp.compilers archives again.