terminological problem

Detlef Meyer-Eltz <Meyer-Eltz@t-online.de>
13 Oct 2005 20:38:54 -0400

          From comp.compilers

Related articles
terminological problem Meyer-Eltz@t-online.de (Detlef Meyer-Eltz) (2005-10-13)
Re: terminological problem (EBNF & regular expressions) paul@parsetec.com (Paul Mann) (2005-10-14)
Re: terminological problem (EBNF & regular expressions) Meyer-Eltz@t-online.de (Detlef Meyer-Eltz) (2005-10-15)
| List of all articles for this month |

From: Detlef Meyer-Eltz <Meyer-Eltz@t-online.de>
Newsgroups: comp.compilers
Date: 13 Oct 2005 20:38:54 -0400
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 13 Oct 2005 20:38:54 EDT

I remember once here was a question about parser generators, which use
regular expressions instead of EBNF expressions. Somebody answered
EBNF expressions are regular expressions.

The TextTransformer uses for the tokens POSIX style (matching the
longest input) regular expressions with '*', '+' and '?' for repeats
and options and the same syntax is used for the non backtracking

How can I describe both kinds of syntax briefly and correctly?


Detlef Meyer-Eltz



Post a followup to this message

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