scientific article; zbMATH DE number 4197438

MaRDI QIDQ5203697zbMATH OpenFDO

Authors Peichen Pan

Publication date 1989

zbMATH Keywords

context-free grammarEarley's algorithmdesign and analysis of algorithmcontext-free parsing algorithm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• A new approach to Earley's parsing algorithm
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• scientific article; zbMATH DE number 4119661
• Practical Earley Parsing
• scientific article; zbMATH DE number 975704

Cited in

(41)

• scientific article; zbMATH DE number 1183241 (Why is no real title available?)
• Derivatives of parsing expression grammars
• A yo-yo parsing algorithm for a large class of van Wijngaarden grammars
• scientific article; zbMATH DE number 4051037 (Why is no real title available?)
• scientific article; zbMATH DE number 1962795 (Why is no real title available?)
• scientific article; zbMATH DE number 4003556 (Why is no real title available?)
• scientific article; zbMATH DE number 4039342 (Why is no real title available?)
• Chart algorithm-based binary combinatorial grammar parsing
• Producing the left parse during bottom-up parsing
• Fast context-free grammar parsing requires fast Boolean matrix multiplication
• scientific article; zbMATH DE number 4191135 (Why is no real title available?)
• scientific article; zbMATH DE number 140485 (Why is no real title available?)
• scientific article; zbMATH DE number 1952680 (Why is no real title available?)
• scientific article; zbMATH DE number 1759522 (Why is no real title available?)
• scientific article; zbMATH DE number 7453089 (Why is no real title available?)
• Deterministic parsing for augmented context-free grammars
• Dynamic programming parsing for context-free grammars in continuous speech recognition
• Efficient \(LR(1)\) processor construction
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• On parsing and condensing substrings of LR languages in linear time
• scientific article; zbMATH DE number 4119661 (Why is no real title available?)
• Recognition is not parsing - SPPF-style parsing from cubic recognisers
• A cubic time extensions of context-free grammars
• A polynomial-time parsing algorithm for \(K\)-depth languages
• Pattern selector grammars and several parsing algorithms in the context- free style
• FUNCTIONAL PEARL Functional chart parsing of context-free grammars
• scientific article; zbMATH DE number 219261 (Why is no real title available?)
• Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
• A new approach to Earley's parsing algorithm
• An error correcting parser for context free grammars that takes less than cubic time
• A Linear Parsing Algorithm For Parenthesis Terms
• scientific article; zbMATH DE number 4155910 (Why is no real title available?)
• Linear algorithm for lexicographic enumeration of CFG parse trees
• The Cocke-Younger-Kasami algorithm. -- Revised
• Practical Earley Parsing
• scientific article; zbMATH DE number 1560215 (Why is no real title available?)
• Generalized LR parsing for grammars with contexts
• Multipass precedence analysis
• Combinatorial Pattern Matching
• Generalized LR parsing algorithm for grammars with one-sided contexts
• scientific article; zbMATH DE number 3843161 (Why is no real title available?)

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 Q5203697)