Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ACTA
2007

favoriteEmaildiscussreport

114views more ACTA 2007»

Recursive descent parsing for Boolean grammars

13 years 4 months ago

Recursive descent parsing for Boolean grammars

Download users.utu.fi

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally deﬁned by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.

Alexander Okhotin

Real-time Traffic

ACTA 2007 | Context-free Grammars | Explicit Set-theoretic Operations | Grammars |

claim paper

Related Content

» Parsing Expression Grammar as a Primitive RecursiveDescent Parser with Backtracking

» TRX A Formally Verified Parser Interpreter

» Design patterns for parsing

» Packrat parsing simple powerful lazy linear time functional pearl

» Packrat Parsing Simple Powerful Lazy Linear Time

» Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	ACTA
Authors	Alexander Okhotin

Comments (0)