A parallel parsing algorithm for arbitrary context-free grammars (Q1350210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127296904, #quickstatements; #temporary_batch_1728306610321
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00023-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1525869800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Parsing on a One-Way Array of Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition and parsing on the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed of Recognition of Context-Free Languages by Array Automata / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127296904 / rank
 
Normal rank

Latest revision as of 14:29, 7 October 2024

scientific article
Language Label Description Also known as
English
A parallel parsing algorithm for arbitrary context-free grammars
scientific article

    Statements

    A parallel parsing algorithm for arbitrary context-free grammars (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    parallel algorithms
    0 references
    parsing
    0 references
    context-free grammars
    0 references
    multiprocessors
    0 references

    Identifiers