denote the attribute-value language of an R-AVG by ${\cal A'}(A,V,L)$ to make the distinction clear. The CST of an R-AVG is produced by a chain- and $\epsilon$-rule free regular grammar. The CST of an R-AVG can be either a left-branching or a right-branching tree, since the grammar contains at most one nonterminal in each rule.

The set of syntactic rules of a restricted attribute-value grammar is a subset of $\bigcup_{i\geq 1, k\leq 1}
{\mathord{\rm Cat}}\times{\mathord{\rm Lex}}^i\times {\mathord{\rm Cat}}^k\times {\cal A'}(A,\{x_0,x_k\},L)$. A [*restricted attribute-value grammar*]{} is a pair $\mathopen{<}\mathord{\rm rules},\mathord{\rm start}
\mathclose{>}$, where rules is a set of syntactic rules and start is an element of ${\mathord{\rm Cat}}$.

An R-AVG $\mathopen{<}\mathord{\rm rules},\mathord{\rm start}
\mathclose{>}$ [*generates*]{} an annotated constituent structure tree $\mathopen{<}T,F,h\mathclose{>}$ iff

1.  the root node of $T$ is start, and

2.  every internal node of $T$ is licensed by a syntactic rule, and

3.  the set $F$ is consistent, i.e., describes a feature graph.

Let $\phi[x/y]$ stand for the formula $\phi$ in which all variable $y$ is substituted for variable $x$. An internal node $v$ of an annotated constituent structure tree is [*licensed*]{} by a syntactic rule $(c_0, l_1,\ldots,l_i,\phi)$ iff

1.  the node $v$ is labeled with category $c_0$, $h(v) 