On Deterministic Multi-Pass Analysis

DOI10.1137/0215049zbMATH Open0611.68051OpenAlexW2082117141MaRDI QIDQ3751036FDOQ3751036

Authors Claudio Citrini, Stefano Crespi Reghizzi, Dino Mandrioli

Publication date 1986

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0215049

zbMATH Keywords

LR grammarscontrol languagesBoolean algebra of formal languagescascade composition of push-down automatacontext-free deterministic languagesdeterministic chainsmulti-pass compilersmulti-pass translationpush-down transducerssyntax-directed translation schemes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3995074
• scientific article; zbMATH DE number 3905868
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Multipass precedence analysis
• High level tree transducers and iterated pushdown tree transducers

Cited in

(9)

• scientific article; zbMATH DE number 3995074 (Why is no real title available?)
• scientific article; zbMATH DE number 7770052 (Why is no real title available?)
• scientific article; zbMATH DE number 3905868 (Why is no real title available?)
• Iterated uniform finite-state transducers on unary languages
• Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
• Iterated uniform finite-state transducers on unary languages
• Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
• Descriptional complexity of iterated uniform finite-state transducers
• QRT FIFO automata, breadth-first grammars and their relations

This page was built for publication: On Deterministic Multi-Pass Analysis

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