Method, apparatus and computer program product for optimizing registers
in a stack using a register allocator
    4.
    发明授权
    Method, apparatus and computer program product for optimizing registers in a stack using a register allocator 失效
    用于使用寄存器分配器优化堆栈中的寄存器的方法,装置和计算机程序产品

    公开(公告)号:US6018799A

    公开(公告)日:2000-01-25

    申请号:US121167

    申请日:1998-07-22

    CPC分类号: G06F8/441 G06F8/443

    摘要: Apparatus, methods and computer program products are disclosed that enable a compiler to generate efficient code to access stack registers on a register stack. The invention operates by transforming a three-operand instruction, within a compiler's intermediate representation, to one or more fewer-than-three-operand instructions. The invention also transforms the instruction's operand addressing from an access to a pseudo-named register to an access to a stack register through stack offset into a register stack. The invention also determines the register stack state at each instruction responsive to register stack permutations and maps the stack offset accordingly for each subsequent access to a stack register.

    摘要翻译: 公开了装置,方法和计算机程序产品,其使得编译器能够生成有效代码来访问寄存器堆栈上的堆栈寄存器。 本发明通过将编译器的中间表示中的三操作数指令变换成一个或多个少于三个操作数的指令来进行操作。 本发明还将指令的操作数寻址从访问伪命名寄存器转换为通过堆栈偏移到堆栈寄存器的访问到寄存器堆栈。 本发明还响应于寄存器堆栈排列确定每个指令处的寄存器堆栈状态,并相应地映射堆栈偏移量,以便每次后续访问堆栈寄存器。

    Vectorized LR parsing of computer programs
    5.
    发明授权
    Vectorized LR parsing of computer programs 失效
    计算机程序的向量化LR解析

    公开(公告)号:US5193192A

    公开(公告)日:1993-03-09

    申请号:US571502

    申请日:1990-08-23

    申请人: David A. Seberger

    发明人: David A. Seberger

    摘要: A parser for parsing computer programs in a compiler has parsing tables arranged as linear vectors. In a reduction portion of the parser, a production table and a lookahead set table have paired entries at identical address offsets such that a one-to-one relationship exists between each lookahead set in the lookahead set table and the representation of the lookahead set in the lookahead set table. In a read transition portion of the parser, an entrance symbol table has entries paired with transition state representations and each pair being at an identical address offset in the respective tables. For a reduction or read transition operation, the lookahead set table or the entrance symbol table is scanned to find the appropriate entry. Once the appropriate entry is found, the production table or the transition state table is addressed using the offset of the appropriate entry found during the scanning process.

    摘要翻译: 用于在编译器中解析计算机程序的解析器具有排列成线性向量的解析表。 在解析器的缩减部分中,生产表和前瞻集合表具有相同地址偏移处的配对条目,使得在前瞻集合表中设置的每个前瞻头与在前置集合表示中存在一对一关系 先行设定表。 在解析器的读取转换部分中,入口符号表具有与过渡状态表示配对的条目,并且每对在各个表中具有相同的地址偏移。 对于缩小或读取转换操作,扫描前瞻集合表或入口符号表以找到适当的条目。 找到适当的条目后,使用扫描过程中找到的适当条目的偏移来寻址生产表或过渡状态表。