scientific article; zbMATH DE number 7453089

MaRDI QIDQ5020538zbMATH OpenFDO

Authors Mark Minas

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1912.09609, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GCM2019.4

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Even faster generalized LR parsing
• scientific article; zbMATH DE number 4197438
• Efficient parallel and incremental parsing of practical context-free languages
• Practical optimization of LR(1) parsers
• INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
• A refined notion of memory usage for minimalist parsing
• scientific article; zbMATH DE number 67829
• scientific article; zbMATH DE number 140485
• An efficient all-parses systolic algorithm for general context-free parsing
• On the complexity of parallel parsing of general context-free languages

Cites work

• BRNGLR: a cubic Tomita-style GLR parsing algorithm
• Concepts and realization of a diagram editor generator based on hypergraph transformation
• Evaluating GLR parsing algorithms
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamental Approaches to Software Engineering
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
• Hyperedge replacement: grammars and languages
• On the translation of languages from left to right
• The complexity of graph languages generated by hyperedge replacement

Cited in

(1)

• scientific article; zbMATH DE number 57113 (Why is no real title available?)

Describes a project that uses

Uses Software

• BRNGLR

This page was built for publication:

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