In computer science, SYNTAX is a system used to generate lexical and syntactic analyzers (parsers) (both deterministic and non-deterministic) for all kind of context-free grammars (CFG) as well as some classes of contextual grammars. It is developed at INRIA (France) for several decades, mostly by Pierre Boullier, but has become free software since 2007 only. SYNTAX is distributed under the CeCILL license.
SYNTAX handles most classes of deterministic (unambiguous) grammars (LR, LALR, RLR as well as general context-free grammars. The deterministic version has been used in operational contexts (e.g., Ada), and is currently used both in the domain of compilation. The non-deterministic features include an Earley parser generator used for natural language processing. Parsers generated by SYNTAX include powerful error recovery mechanisms, and allow the execution of semantic actions and attribute evaluation on the abstract tree or on the shared parse forest.
The current version of SYNTAX (version 6.0 beta) includes also parser generators for other formalisms, used for natural language processing as well as bio-informatics. These formalisms are context-sensitive formalisms (TAG, RCG or formalisms that rely on context-free grammars and are extended thanks to attribute evaluation, in particular for natural language processing (LFG).
- The first tool-translator for the ADA language has been developed with SYNTAX by Pierre Boullier and others, as recalled in this page on the history of ADA. See also Pierre Boullier and Knut Ripken. Building an Ada compiler following meta-compilation methods. In Séminaires Langages et Traducteurs 1978-1981, pages 99-140. INRIA, Rocquencourt, France, 1981.
- E.g., by the VASY team at INRIA, in particular for the development of CADP and Traian.
- E.g., in the SxLFG parser, whose first version is described in this paper.