Generation, recognition and parsing of context-free languages by means of recursive graphs (Q2559926): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Design of a separable transition-diagram compiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / 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: Q4194485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On context-free languages and push-down automata / rank
 
Normal rank

Latest revision as of 12:48, 12 June 2024

scientific article
Language Label Description Also known as
English
Generation, recognition and parsing of context-free languages by means of recursive graphs
scientific article

    Statements

    Generation, recognition and parsing of context-free languages by means of recursive graphs (English)
    0 references
    0 references
    0 references
    0 references
    1973
    0 references
    0 references