How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
Communications of the ACM
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The art of Prolog (2nd ed.): advanced programming techniques
The art of Prolog (2nd ed.): advanced programming techniques
Memoizing purely functional top-down backtracking language processors
Science of Computer Programming
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
The Definition of Standard ML
Techniques for automatic memoization with applications to context-free parsing
Computational Linguistics
Applicative programming with effects
Journal of Functional Programming
Characterizing unambiguous precedence systems in expressions without superfluous parentheses
International Journal of Computer Mathematics
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Powerful and seamless syntax extensions on a statically typed language
Proceedings of the 12th annual international conference companion on Aspect-oriented software development
Typed syntactic meta-programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
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.