next up previous contents
Next: Solving a query Up: A Powerful Grammar Formalism Previous: ()-grammars

Procedural Semantics

In this section I define the procedural semantics of our formalism using the standard terminology as for example presented in [50]. The procedural semantics for $ \cal {R}$($ \cal {L}$) will be similar to Prolog's procedural semantics. For grammars I will investigate different procedural semantics, i.e. parsing and generation strategies, in the chapters 3 and 4. However, as I will define these alternative strategies as meta interpreters within $ \cal {R}$($ \cal {L}$) itself, it will still be useful to define the `basic' procedural semantics here.

Noord G.J.M. van