CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Labelled BNF: a high-level formalism for defining well-behaved programming languages

Markus Forsberg (Institutionen för datavetenskap) ; Aarne Ranta
Proceedings of the Estonian Academy of Sciences, Physics, Mathem, December 2003 Vol. 52 (2003), 4, p. 356.
[Konferensbidrag, refereegranskat]

The grammar formalism Labelled BNF (LBNF) and the compiler construction tool BNF Converter are introduced. Given a grammar written in LBNF, the BNF Converter produces a complete compiler front end (up to, but excluding, type checking), i.e. a lexer, a parser, and an abstract syntax definition. Moreover, it produces a pretty-printer and a language specification in L A T E X, as well as a template file for the compiler back end. A language specification in LBNF is completely declarative and therefore portable. It reduces dramatically the effort of implementing a language. The price to pay is that the language must be "well-behaved", i.e. that its lexical structure must be describable by a regular expression and its syntax by a context-free grammar.



Denna post skapades 2013-01-15. Senast ändrad 2014-04-14.
CPL Pubid: 170760

 

Institutioner (Chalmers)

Institutionen för datavetenskap (2002-2004)
Institutionen för data- och informationsteknik, datavetenskap (GU) (GU)

Ämnesområden

Data- och informationsvetenskap

Chalmers infrastruktur