Parsing mixfix operators
Paper i proceeding, 2011
A simple grammar scheme for expressions containing mixfix operators is presented. The scheme is parameterised by a precedence relation which is only restricted to be a directed acyclic graph; this makes it possible to build up precedence relations in a modular way. Efficient and simple implementations of parsers for languages with user-defined mixfix operators, based on the grammar scheme, are also discussed. In the future we plan to replace the support for mixfix operators in the language Agda with a grammar scheme and an implementation based on this work. © 2011 Springer-Verlag.
Författare
Nils Anders Danielsson
University of Nottingham
Ulf Norell
Chalmers, Data- och informationsteknik, Datavetenskap
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 5836 80-99978-364224451-3 (ISBN)
Ämneskategorier
Data- och informationsvetenskap
DOI
10.1007/978-3-642-24452-0_5
ISBN
978-364224451-3