A parallel algorithm for counting parse trees

A parallel algorithm for computing the number of parse trees of a given string according to a fixed context-free grammar is defined. More generally, the algorithm applies to computing the weight of a string in a weighted grammar over any semiring. The algorithm is first implemented on an arithmetic...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 303; p. 105237
Main Authors:	Mikhelson, Margarita, Okhotin, Alexander
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.03.2025
Subjects:	Context-free grammars Matrix multiplication Parallel algorithms Parsing Weighted grammars Weighted grammars Matrix multiplication Parsing Parallel algorithms Context-free grammars
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!