|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:||"Virendra Kr. Mehta" <firstname.lastname@example.org>|
|Date:||Mon, 14 Nov 1994 17:23:36 GMT|
[looking for tool that will create an input string given a grammar and a
One such tool has been developed at Wipro Systems as part of their general
purpose language translator development project. The stand alone module which
traverses a tree and generates programs out of it is called an 'unparser'. It
is very easily customizable to a particular language or program structure and
accepts specifications for the same in a simple regular expression based
language. Also, it allows you to specify variable formatting and of code and
comments depending on their position.
The specifiction language however is not like EBNF, but more based on tree
nodes and their interconnectivity. I can't remember the reference right now,
but someone did some work on using the EBNF for both parsing and unparsing
specifications. The software was called 'parsrap' or something (a palindrome).
Information about it should be somewhere in this newsgroup's archives.
Virendra K Mehta
J2-C72, TJWatson Res. Centre
30, Sawmill River Road,
Hawthorne, NY - 10532.
(914) 784 - 7774 (off)
(914) 734 - 2656 (res)
Return to the
Search the comp.compilers archives again.