Left-associative grammar (LAG)

  • Roland Hausser


The previous Chapters 7–9 developed the basic notions for analyzing artificial and natural languages within the historical formalisms of C-grammar (1929) and PS-grammar (1935). The following Chapters 10–12 will apply these notions to the third elementary formalism, namely LA-grammar (1985).1 This comparatively new formalism has not been borrowed from some other field of research to be adapted to natural language analysis, but was developed from the outset as a time-linear, type transparent algorithm that is input-output equivalent with the speaker-hearer.


Derivation Order Successful Rule Structure List Rule Schema Intermediate Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Roland Hausser
    • 1
  1. 1.Friedrich Alexander University Erlangen NürnbergErlangenGermany

Personalised recommendations