Left-associative grammar (LAG)
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.
KeywordsDerivation Order Successful Rule Structure List Rule Schema Intermediate Expression
Unable to display preview. Download preview PDF.