transparent gif


Ej inloggad.

Göteborgs universitets publikationer

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

Författare och institution:
Markus Forsberg (Institutionen för datavetenskap, Chalmers); Aarne Ranta (Institutionen för data- och informationsteknik, datavetenskap (GU))
Publicerad i:
Proceedings of the Estonian Academy of Sciences, Physics, Mathem, December 2003, 52 ( 4 ) s. 356
Konferensbidrag, refereegranskat
Sammanfattning (abstract):
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.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
Data- och informationsvetenskap
Postens nummer:
Posten skapad:
2013-01-15 15:37
Posten ändrad:
2014-04-14 15:11

Visa i Endnote-format

Göteborgs universitet • Tel. 031-786 0000
© Göteborgs universitet 2007