Abstract
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.
Cite
CITATION STYLE
Danielsson, N. A., & Norell, U. (2011). Parsing mixfix operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5836 LNCS, pp. 80–99). https://doi.org/10.1007/978-3-642-24452-0_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
