Parsing Expression Grammars: A Recognition-Based Syntactic Foundation by Bryan Ford, MIT, 2004.
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols.
The power of generative grammars to express ambiguity is crucial to their original purpose of modelling natural languages, but this very power makes it unnecessarily difficult both to express and to parse machine-oriented languages using CFGs.
Parsing Expression...
Pure and Declarative Syntax Definition: Paradise Lost...
Pure and Declarative Syntax Definition: Paradise Lost and Regained by Lennart C. L. Kats, Eelco Visser, Guido Wachsmuth from Delft Syntax definitions are pervasive in modern software systems,...
π: a pattern language
π - not to be confused with the π-calculus - is a pattern-based language being developed by the Software Technology group at Technische Universität Darmstadt. Quoting from the project...
COLA Brainfuck
From the Software Architecture Group at the Hasso Plattner Institut: Our tutorial on COLA provides insight on how programming languages can be implemented using the combined abstractions and...
Post new comment