Fast parsing for Boolean grammars: a generalization of Valiant's algorithm

Authors:
Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland and Academy of Finland
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 7
Cited 6

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Boolean grammars

Information and Computation
Recursive descent parsing for Boolean grammars

Acta Informatica
Unambiguous Boolean grammars

Information and Computation
Well-founded semantics for Boolean grammars

Information and Computation
General context-free recognition in less than cubic time

Journal of Computer and System Sciences

Comparing linear conjunctive languages to subfamilies of the context-free languages

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Language equations with complementation: Expressive power

Theoretical Computer Science
Defining contexts in context-free grammars

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the number of nonterminal symbols in unambiguous conjunctive grammars

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Parsing Boolean grammars over a one-letter alphabet using online convolution

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

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 and System Sciences, 10:2 (1975), 308-314) is refactored and generalized to handle the more general Boolean grammars. The algorithm reduces construction of the parsing table to computing multiple products of Boolean matrices of various size. Its time complexity on an input string of length n is O(BMM(n) log n), where BMM(n) is the number of operations needed to multiply two Boolean matrices of size n × n, which is O(n2.376) as per the current knowledge.