On deterministic multi-pass analysis
Chains (or cascade composition) of push-down transducers are introduced as a model of multi-pass compilers. We focus on deterministic chains, since nondeterministic transducer chains of length two define the recursively enumerable sets. Deterministic chains recognize in linear time a superset of con...
Gespeichert in:
Veröffentlicht in: | SIAM journal on computing 1986-08, Vol.15 (3), p.668-693 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Chains (or cascade composition) of push-down transducers are introduced as a model of multi-pass compilers. We focus on deterministic chains, since nondeterministic transducer chains of length two define the recursively enumerable sets. Deterministic chains recognize in linear time a superset of context-free deterministic languages. This family is $\mathcal{CH}$ closed under Boolean operations, disjoint shuffle,and reverse deterministic pushdown translation, but not under homomorphism. Equivalent definitions of the family in terms of composition of syntax-directed translation schemes and control languages are considered. The family is a strict hierarchy ordered by the length of the chain. The complexity of $\mathcal{CH}$ is obviously linear, but not all linear-time parsable languages are in $\mathcal{CH}$. On the other hand it strictly includes the Boolean closure of deterministic languages. Finally $\mathcal{CH}$ is not comparable with another classical Boolean algebra of formal languages, namely real-time languages. |
---|---|
ISSN: | 0097-5397 1095-7111 |
DOI: | 10.1137/0215049 |