Re: Parser Reversed

Hans-Peter Diettrich <>
Tue, 13 Mar 2018 11:23:02 +0100

          From comp.compilers

Related articles
Parser Reversed (Hans-Peter Diettrich) (2018-03-11)
Re: Parser Reversed (Matt P. Dziubinski) (2018-03-11)
Re: Parser Reversed (Kaz Kylheku) (2018-03-12)
Re: Parser Reversed (Hans-Peter Diettrich) (2018-03-13)
Re: Parser Reversed (Hans-Peter Diettrich) (2018-03-13)
| List of all articles for this month |

From: Hans-Peter Diettrich <>
Newsgroups: comp.compilers
Date: Tue, 13 Mar 2018 11:23:02 +0100
Organization: Compilers Central
References: 18-03-038 18-03-040
Injection-Info:; posting-host=""; logging-data="60258"; mail-complaints-to=""
Keywords: parse
Posted-Date: 13 Mar 2018 15:35:08 EDT

Am 11.03.2018 um 15:08 schrieb Matt P. Dziubinski:
> On 3/11/2018 08:32, Hans-Peter Diettrich wrote:
>> 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?
> Hi!
> Csmith comes to mind:

Thanks for all the links :-)

> * "Effect-Driven QuickChecking of Compilers" (notably, the following
> goes substantially further than relying solely on the grammar grammar by
> making use of the type system -- more in the paper):
> Code (Effect-Driven Compiler Tester):
> Paper:
> Talk:

Here I'm absolutely lost with the notation :-(


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.