Linear algorithm for lexicographic enumeration of CFG parse trees

DOI10.1007/S11432-009-0132-7MaRDI QIDQ848238zbMATH OpenOpenAlexFDO

Authors Yunmei Dong

Publication date 3 March 2010

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-009-0132-7

zbMATH Keywords

counting of parse treeshierarchical construction of set of parse treeslexicographic enumeration of parse trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1261119
• scientific article; zbMATH DE number 1759522
• scientific article; zbMATH DE number 4197438
• Tree-Adjoining Language Parsing in O(n^6 ) Time
• Grammar-Oriented Enumeration of Binary Trees

Cited in

(1)

• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

This page was built for publication: Linear algorithm for lexicographic enumeration of CFG parse trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848238)