In linguistics and theoretical computer science, literal movement grammars (LMGs) are a grammar formalism intended to characterize certain extraposition phenomena of natural language such as topicalization and cross-serial dependency. LMGs extend the class of context free grammars (CFGs) by adding introducing pattern-matched function-like rewrite semantics, as well as the operations of variable binding and slash deletion. LMGs were introduced by A.V. Groenink in 1995.^[1]

Description

The basic rewrite operation of an LMG is very similar to that of a CFG, with the addition of arguments to the non-terminal symbols. Where a context-free rewrite rule obeys the general schema ${\displaystyle S\to \alpha }$ for some non-terminal ${\displaystyle S}$ and some string of terminals and/or non-terminals ${\displaystyle \alpha }$, an LMG rewrite rule obeys the general schema ${\displaystyle X(x_{1},...,x_{n})\to \alpha }$, where X is a non-terminal with arity n (called a predicate in LMG terminology), and ${\displaystyle \alpha }$ is a string of "items", as defined below. The arguments ${\displaystyle x_{i}}$ are strings of terminal symbols and/or variable symbols defining an argument pattern. In the case where an argument pattern has multiple adjacent variable symbols, the argument pattern will match any and all partitions of the actual value that unify. Thus, if the predicate is ${\displaystyle f(xy)}$ and the actual pattern is ${\displaystyle f(ab)}$, there are three valid matches: ${\displaystyle x=\epsilon ,\ y=ab;\ x=a,\ y=b;\ x=ab,\ y=\epsilon }$. In this way, a single rule is actually a family of alternatives.

An "item" in a literal movement grammar is one of

• ${\displaystyle f(x_{1},\ldots ,x_{n})}$, a predicate of arity n,
• ${\displaystyle x{\text{:}}f(x_{1},\ldots ,x_{n})}$, a variable binding x to the string produced by ${\displaystyle f(x_{1},...,x_{n})}$, or
• ${\displaystyle f(x_{1},\ldots ,x_{n})/\alpha }$, a slash deletion of ${\displaystyle f(x_{1},...,x_{n})}$ by the string of terminals and/or variables ${\displaystyle \alpha }$.

In a rule like ${\displaystyle f(x_{1},...,x_{m})\to \alpha \ y{\text{:}}g(z_{1},...z_{n})\ \beta }$, the variable y is bound to whatever terminal string the g predicate produces, and in ${\displaystyle \alpha }$ and ${\displaystyle \beta }$, all occurrences of y are replaced by that string, and ${\displaystyle \alpha }$ and ${\displaystyle \beta }$ are produced as if terminal string had always been there.

An item ${\displaystyle x/y}$, where x is something that produces a terminal string (either a terminal string itself or some predicate), and y is a string of terminals and/or variables, is rewritten as the empty string (${\displaystyle \epsilon }$) if and only if ${\displaystyle g(y_{1},...,y_{n})=z}$, and otherwise cannot be rewritten at all.

Example

LMGs can characterize the non-CF language ${\displaystyle \{a^{n}b^{n}c^{n}:n\geq 1\}}$ as follows:

${\displaystyle S()\to x{\text{:}}A()\ B(x)}$

${\displaystyle A()\to a\ A()}$

${\displaystyle A()\to \epsilon }$

${\displaystyle B(xy)\to a/x\ b\ B(y)c}$

${\displaystyle B(\epsilon )\to \epsilon }$

The derivation for aabbcc, using parentheses also for grouping, is therefore

${\displaystyle S()\to x{\text{:}}A()\ B(x)\to x{\text{:}}(a\ A())\ B(x)\to x{\text{:}}(aa\ A())\ B(x)\to x{\text{:}}aa\ B(x)\to aa\ B(aa)}$

${\displaystyle \to aa\ a/a\ b\ B(a)\ c\to aab\ B(a)\ c\to aab\ a/a\ b\ B()\ cc\to aabb\ B()\ cc\ \to aabbcc}$

Computational power

Languages generated by LMGs contain the context-free languages as a proper subset, as every CFG is an LMG where all predicates have arity 0 and no production rule contains variable bindings or slash deletions.

References