A new parallel algorithm for parsing arithmetic infix expressions (Q1100920)

From MaRDI portal
Revision as of 01:29, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new parallel algorithm for parsing arithmetic infix expressions
scientific article

    Statements

    A new parallel algorithm for parsing arithmetic infix expressions (English)
    0 references
    0 references
    0 references
    1987
    0 references
    SIMD computer
    0 references
    parallel parsing algorithm
    0 references
    parallel programming
    0 references
    parallel code generation
    0 references
    arithmetic infix expression
    0 references
    parse tree
    0 references
    time complexity
    0 references

    Identifiers