GRAMMAR FORMALISMS VIEWED AS

We consider the use of evolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classic grammar formal- isms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammar formalisms.

[1]  Yuri Gurevich,et al.  Algebraic Operational Semantics and Occam , 1990, CSL.

[2]  Yuri Gurevich,et al.  Algebraic Operational Semantics and Modula-2 , 1987, CSL.

[3]  David E. Johnson,et al.  Arc Pair Grammar , 1980 .

[4]  Egon Börger,et al.  The WAM - Definition and Compiler Correctness , 1995, Logic Programming: Formal Methods and Practical Applications.

[5]  Carl Jesse Pollard,et al.  Generalized phrase structure grammars, head grammars, and natural language , 1984 .

[6]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[7]  William Marsh Graphs and Grammars , 1986 .

[8]  Dean Rosenzweig,et al.  Communicating Evolving Algebras , 1992, CSL.

[9]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[10]  Yuri Gurevich,et al.  Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[11]  Kelly Roach,et al.  Formal Properties of Head Grammars , 1987 .

[12]  C. A. Petri Concepts of Net Theory , 1973, MFCS.

[13]  Yuri Gurevich,et al.  The Semantics of the C Programming Language , 1992, CSL.