Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the membership problem for regular DNLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Straight Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple <i>LR(k)</i> grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognising \(k\)-connected hypergraphs in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual hyperedge replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive Top-Down Parsing for Hyperedge Replacement Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power properties of NLC graph grammars with a polynomial membership problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linearly parsable graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of graph languages generated by hyperedge replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and Context-Free Graph Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair grammars, graph languages and string-to-graph translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037335 / rank
 
Normal rank

Latest revision as of 14:37, 19 July 2024

scientific article
Language Label Description Also known as
English
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
scientific article

    Statements

    Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    hyperedge replacement grammar
    0 references
    graph parsing
    0 references
    grammar analysis
    0 references

    Identifiers