On Deterministic Multi-Pass Analysis

DOI10.1137/0215049MaRDI QIDQ3751036zbMATH OpenOpenAlexFDO

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

Boolean algebra of formal languagescascade composition of push-down automatacontext-free deterministic languagescontrol languagesdeterministic chainsLR grammarsmulti-pass compilersmulti-pass translationpush-down transducerssyntax-directed translation schemes

Mathematics Subject Classification ID

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

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)

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

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)