Some theoretical aspects of parallel parsing

DOI10.1007/BF01074529MaRDI QIDQ3327740zbMATH OpenFDO

Authors A. V. Babichev

Publication date 1982

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01074529

zbMATH Keywords

linear bounded automataparallelism

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4205997
• Parallel \(LL\) parsing
• scientific article; zbMATH DE number 4119661
• Parallel parsing on the connection machine
• Parallel parsing on a one-way linear array of finite-state machines

Cites work

• Automata that accept languages generated by precedence grammars
• scientific article; zbMATH DE number 3395774 (Why is no real title available?)
• Optimization of LR(k) parsers
• Weak and Mixed Strategy Precedence Parsing

Cited in

(9)

• Parallel parsing of programming languages
• Parallel parsing on a one-way linear array of finite-state machines
• Deterministic parsing with P colony automata
• scientific article; zbMATH DE number 4155914 (Why is no real title available?)
• scientific article; zbMATH DE number 3915651 (Why is no real title available?)
• Parallel Parsing on a One-Way Array of Finite-State Machines
• scientific article; zbMATH DE number 57113 (Why is no real title available?)
• scientific article; zbMATH DE number 140111 (Why is no real title available?)
• Parallel \(LL\) parsing

This page was built for publication: Some theoretical aspects of parallel parsing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3327740)