Predictive shift-reduce parsing for hyperedge replacement grammars
From MaRDI portal
(Redirected from Publication:4972011)
Recommendations
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
- Predictive top-down parsing for hyperedge replacement grammars
- Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
- Graph parsing as graph transformation. Correctness of predictive top-down parsers
Cited in
(14)- Probabilistic hyperedge replacement grammars
- Graph grammars according to the type of input and manipulated data: a survey
- The complexity of graph languages generated by hyperedge replacement
- Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars
- Extending predictive shift-reduce parsing to contextual hyperedge replacement 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
- Uniform parsing for hyperedge replacement grammars
- Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
- Predictive top-down parsing for hyperedge replacement grammars
- scientific article; zbMATH DE number 177450 (Why is no real title available?)
- Graph parsing as graph transformation. Correctness of predictive top-down parsers
- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
- Finite automata for efficient graph recognition
This page was built for publication: Predictive shift-reduce parsing for hyperedge replacement grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972011)
