Path: csiph.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Hans-Peter Diettrich Newsgroups: comp.compilers Subject: Parser Reversed Date: Sun, 11 Mar 2018 08:32:55 +0100 Organization: Compilers Central Lines: 16 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <18-03-038@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="20936"; mail-complaints-to="abuse@iecc.com" Keywords: parse, question Posted-Date: 11 Mar 2018 05:44:14 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1988 A grammar can be used to *check* for valid sentences of a language, but it also can be used to *create* valid sentences. For a pretty printer or decompiler test I need a sentence generator for logical expressions. For now the language can be restricted to AND, OR, variables and (kind of) parentheses. Later on NOT and XOR can be added. RPN is one alternative for the "kind of parentheses", eliminating the need for a specific operator precedence. Now I'm looking for possible implementations of such a generator, in addition to my own ideas. So far the output can be anything, e.g. source code or machine code, or some tree (AST...). Any ideas or references to such projects? TIA DoDi