3 Languages
All of the exports in this section are provided both by
redex/reduction-semantics (which includes
all non-GUI portions of Redex) and also exported by
redex (which includes all of Redex).
|
|
non-terminal-spec | | = | | symbol | | | | | | (symbol ...) |
|
This form defines the grammar of a language. It allows the
definition of recursive
patterns, much like a BNF, but for
regular-tree grammars. It goes beyond their expressive
power, however, because repeated
name patterns and
side-conditions can restrict matches in a context-sensitive
way.
The non-terminal-spec can either by a symbol, indicating a
single name for this non-terminal, or a sequence of symbols,
indicating that all of the symbols refer to these
productions.
As a simple example of a grammar, this is the lambda
calculus:
with non-terminals e for the expression language, x for
variables, c for the evaluation contexts and v for values.
This form extends a language with some new, replaced, or
extended non-terminals. For example, this language:
extends lc-lang with two new alternatives for the v
non-terminal, carries forward the e and c
non-terminals, and replaces the x non-terminal with a
new one (which happens to be equivalent to the one that would
have been inherited).
The four-period ellipses indicates that the new language’s
non-terminal has all of the alternatives from the original
language’s non-terminal, as well as any new ones. If a
non-terminal occurs in both the base language and the
extension, the extension’s non-terminal replaces the
originals. If a non-terminal only occurs in either the base
language, then it is carried forward into the
extension. And, of course, extend-language lets you add new
non-terminals to the language.
If a language is has a group of multiple non-terminals
defined together, extending any one of those non-terminals
extends all of them.
Returns the list of non-terminals (as symbols) that are
defined by this language.
Returns #t if its argument was produced by language, #f
otherwise.