|AST must for xlator? rramsey500NOSPAM@earthlink.net (Russ Ramsey) (2002-05-12)|
|Re: AST must for xlator? email@example.com (2002-05-17)|
|Re: AST must for xlator? firstname.lastname@example.org (James Powell) (2002-05-31)|
|From:||"Russ Ramsey" <rramsey500NOSPAM@earthlink.net>|
|Date:||12 May 2002 00:06:35 -0400|
|Organization:||EarthLink Inc. -- http://www.EarthLink.net|
|Posted-Date:||12 May 2002 00:06:35 EDT|
I wrote Lex & Yacc code to parse SAS; now how do I output the
symbols into COBOL?
Assuming each statement of one equals only one statement of the
other. On the grammar rules actions can I just save to tree the
equivalent tokens and then print them out infix? Any examples out
there of the simplest data structure for this purpose?
Return to the
Search the comp.compilers archives again.