In this paper, we combine the hidden step η of the authors’ paper [2] with the empty process ε of VRANCKEN [12] and the authors’ [3]. We formulate a system ACPc, which is a conservative extension of the systems AC...
In this paper, we combine the hidden step η of the authors’ paper [2] with the empty process ε of VRANCKEN [12] and the authors’ [3]. We formulate a system ACPc, which is a conservative extension of the systems ACPη, ACP√, but also of ACPτ. This is a general system, in which most relevant issues can be discussed. Abstraction from internal steps can be achieved in two ways, in two stages: we can abstract to the hidden step η, and then from η to Milner’s silent step τ.
An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers. We motivate the need for these t...
ISBN:
(纸本)9780897913065
An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers. We motivate the need for these techniques in the context of interactive language definition environments, present all required algorithms, and give measurements comparing their performance with that of conventional techniques.
We present semantics for logic programs using term rewrite systems. Reading program lines from left to right (so reversing the arrows), considering the result as a rewrite system, immediately gives the usual declarati...
详细信息
暂无评论