Design of a separable transition-diagram compiler
From MaRDI portal
Publication:5725063
DOI10.1145/366663.366704zbMath0116.09605OpenAlexW1991570511WikidataQ56209710 ScholiaQ56209710MaRDI QIDQ5725063
Publication date: 1963
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/366663.366704
Related Items (27)
The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines ⋮ A technique for generating interpretive translators for problem-oriented languages ⋮ An operator net model for distributed systems ⋮ Coroutine sequencing in a block structured environment ⋮ Control extension in a recursive language ⋮ On logic of complex algorithms ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ Safe functional systems through integrity types and verified assembly ⋮ A New Method for Dependent Parsing ⋮ A theory for program and data type specification ⋮ Concurrent programming in the Ada® language: The polling bias ⋮ Automatic correction of syntax-errors in programming languages ⋮ A low‐cost implementation of coroutines for C ⋮ A proof rule for multiple coroutine systems ⋮ Deadlock detection for actor-based coroutines ⋮ Intercalation lemmas for tree transducer languages ⋮ Augmented transition networks and their relation to tree transducers ⋮ Fast deterministic parsers for transition networks ⋮ Towards a Taxonomy for ECFG and RRPG Parsing ⋮ Simple chain grammars and languages ⋮ A theory of RPC calculi for client–server model ⋮ An application of coroutines and backtracking in interactive systems ⋮ Top-down syntax nalysis ⋮ Generation, recognition and parsing of context-free languages by means of recursive graphs ⋮ Two WAM Implementations of Action Rules ⋮ Light-weight synchronous Java (SJL): an approach for programming deterministic reactive systems with Java ⋮ Using coroutines in pascal
This page was built for publication: Design of a separable transition-diagram compiler
