left-associative grammar

A term used in COMPUTATIONAL LINGUISTICS for a type of GRAMMAR which operates with a regular order of LINEAR compositions. This approach, based on the building up and cancelling of VALENCIES, aims to avoid the irregular ordering introduced by CONSTITUENT STRUCTURE analysis which, it claims, results in computational inefficiency. Left-associative PARSERS are distinctive in that the history of the parse doubles as the linguistic analysis.