From mboxrd@z Thu Jan  1 00:00:00 1970
Message-ID: <b180d46d4659c7065d7676a84c43df86@terzarima.net>
From: Charles Forsyth <forsyth@terzarima.net>
Date: Fri, 21 Aug 2009 02:14:35 +0100
To: 9fans@9fans.net
In-Reply-To: <a85dde21bb450f779bc73f5c904cfa55@quanstro.net>
MIME-Version: 1.0
Content-Type: text/plain; charset="US-ASCII"
Content-Transfer-Encoding: 7bit
Subject: Re: [9fans] Recursive structural expressions?
Topicbox-Message-UUID: 4fbb4d24-ead5-11e9-9d60-3106f5b1d025

qed allowed naming of regular expressions using `e' and their recursive invocation
using \E, with results suggested earlier.

http://cm.bell-labs.com/cm/cs/who/dmr/qedman.html
http://cm.bell-labs.com/cm/cs/who/dmr/qedman.pdf

``It should be noted that the ability to define regular expressions recursively makes the term "regular expression" a misnomer: it is not hard to see that expressions can be constructed to match exactly the members of any given context-free language.''