8 search results - page 1 / 2 » Fast Parsing for Boolean Grammars: A Generalization of Valia... |
DLT
2010
13 years 6 months ago
2010
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
JACM
2002
13 years 4 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
ACL
1997
13 years 6 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
IJFCS
2006
13 years 4 months ago
2006
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
ACTA
2007
13 years 4 months ago
2007
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 f...