Parsing Expression Grammars

Courtesy Lambda the Ultimate - Programming Languages Weblog  Mon, 10/06/2008 - 00:02

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...


 

More related items

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...

18x External Samsung DVD±RW DL Drive
Specifications Data Transfer Rate Media Type Write Read DVD+R 18X (24.3MB/sec) 12X (16.2MB/sec) DVD+R Double 8X (10.8MB/sec) 8X (10.8MB/sec) DVD+RW 8X (10.8MB/sec) 8X (10.8MB/sec) DVD-R 18X...

Programming Collective Intelligence: Building Smart...
Want to tap the power behind search rankings, product recommendations, social bookmarking, and online matchmaking? This fascinating book demonstrates how you can build Web 2.0 applications to...


 

Post new comment

The content of this field is kept private and will not be shown publicly.
Popular by tags

computer-internet.marc8.com