Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars

DOI10.1007/978-3-030-23611-3_4MaRDI QIDQ2292968zbMATH OpenOpenAlexFDO

Authors Frank Drewes, Berthold Hoffmann, Mark Minas

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23611-3_4

zbMATH Keywords

contextual hyperedge replacementgraph grammargraph parsing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Predictive shift-reduce parsing for hyperedge replacement grammars
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
• Predictive top-down parsing for hyperedge replacement grammars
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• scientific article; zbMATH DE number 1962786
• scientific article; zbMATH DE number 1951550
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Probabilistic hyperedge replacement grammars
• Parsing weighted order-preserving hyperedge replacement grammars
• Uniform parsing for hyperedge replacement grammars

Cited in

(12)

• Synchronous hyperedge replacement graph grammars
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
• Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Predictive top-down parsing for hyperedge replacement grammars
• An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
• Predictive shift-reduce parsing for hyperedge replacement grammars
• Graph parsing as graph transformation. Correctness of predictive top-down parsers
• Transduction from trees to graphs through folding
• On the power of local graph expansion grammars with and without additional restrictions
• Finite automata for efficient graph recognition

This page was built for publication: Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars

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