一个指令序列半群的表示与扩张
Expressiveness and Extensions of an Instruction Sequence Semigroup
摘要:
PGA是ProGram Algebra的缩写,它将顺序程序描述为有限或无限(重复)的指令序列。有限指令序列的半群C被引入作为PGA的等价表达替代。PGA指令是从左到右执行的;大多数C指令都有从左到右和从右到左的风格。本文在C语言的基础上,引入了一个可供选择的半群Cg,它使用标号和goto指令代替相对跳转指令作为控制结构。Cg可以翻译成C,反之亦然(因此同样具有表达性)。结果表明,限制C和Cg的指令集只包含两个或两个方向上的许多不同的跳转,转到或标签指令,降低了它们的表现力。在两个方向上具有无限数量的这些指令的指令集(不一定是所有这样的指令)不会遭受表达性的损失。
英文摘要:
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequences of instructions. The semigroup C of finite instruction sequences was introduced as an equally expressive alternative to PGA. PGA instructions are executed from left to right; most C instructions come in a left-to-right as well as a right-to-left flavor. This thesis builds on C by introducing an alternative semigroup Cg which employs label and goto instructions instead of relative jump instructions as control structures. Cg can be translated to C and vice versa (and is thus equally expressive). It is shown that restricting the instruction sets of C and Cg to contain only finitely many distinct jump, goto or label instructions in either or both directions reduces their expressiveness. Instruction sets with an infinite number of these instructions in both directions (not necessarily all such instructions) do not suffer a loss of expressiveness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。