From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407)

From MaRDI portal
Revision as of 23:40, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
From Ambiguous Regular Expressions to Deterministic Parsing Automata
scientific article

    Statements

    From Ambiguous Regular Expressions to Deterministic Parsing Automata (English)
    0 references
    0 references
    0 references
    0 references
    23 September 2015
    0 references
    0 references
    regular expression
    0 references
    syntax tree
    0 references
    Berry-Sethi algorithm
    0 references
    ambiguity
    0 references
    parsing
    0 references