Design of a separable transition-diagram compiler
From MaRDI portal
Cited in
(27)- An operator net model for distributed systems
- On logic of complex algorithms
- On the relationship between the LL(k) and LR(k) grammars
- A theory for program and data type specification
- Automatic correction of syntax-errors in programming languages
- A proof rule for multiple coroutine systems
- Intercalation lemmas for tree transducer languages
- Augmented transition networks and their relation to tree transducers
- Simple chain grammars and languages
- Fast deterministic parsers for transition networks
- Deadlock detection for actor-based coroutines
- Safe functional systems through integrity types and verified assembly
- Light-weight synchronous Java (SJL): an approach for programming deterministic reactive systems with Java
- Top-down syntax nalysis
- Generation, recognition and parsing of context-free languages by means of recursive graphs
- The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
- A New Method for Dependent Parsing
- Concurrent programming in the Ada® language: The polling bias
- Towards a Taxonomy for ECFG and RRPG Parsing
- Using coroutines in pascal
- An application of coroutines and backtracking in interactive systems
- A theory of RPC calculi for client-server model
- A low‐cost implementation of coroutines for C
- Two WAM Implementations of Action Rules
- A technique for generating interpretive translators for problem-oriented languages
- Coroutine sequencing in a block structured environment
- Control extension in a recursive language
This page was built for publication: Design of a separable transition-diagram compiler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5725063)
