首页> 外国专利> METHOD FOR PROCESSING STACK OF PROLOG MACHINE

METHOD FOR PROCESSING STACK OF PROLOG MACHINE

机译:序号机堆栈处理方法

摘要

PURPOSE:To simplify an allocating processing by determining a survival sequence from the variable used for the argument of a main body part goal with a compiler and executing the allocation to the value cell permanent variable register of an environment frame in the generation sequence. CONSTITUTION:At a stack area, the selecting point frame of a procedure (p) is formed, and a B register is set so as to show a frame top. A first clause (p) is developed to a machine instruction column. The clause has four permanent variables, and consequently, the formation of the environment frame is necessary. In an allocate instruction 6, is helded for an operand and the whole size of the environment frame including four words of a permanent variable cell part is designated. Here, into the stack area, a pointer to a continuous environment frame and a code address corresponding to the goal to be executed after the execution of said clause is normally completed are stored, and under it, the value cells corresponding to variables A, B, C and D are allocated.
机译:目的:通过使用编译器从用于主体部分目标的自变量的变量确定生存序列,并在生成序列中执行对环境框架的值单元永久变量寄存器的分配,以简化分配过程。组成:在堆栈区域,形成了过程(p)的选择点框架,并设置了一个B寄存器以显示框架顶部。第一条(p)被开发到机器指令列。该子句具有四个永久变量,因此,必须形成环境框架。在分配指令6中,保持操作数,并且指定包括永久变量单元部分的四个字的环境帧的整个大小。在此,在堆栈区域中存储了指向连续环境框架的指针和与通常完成所述子句执行之后要执行的目标相对应的代码地址,并在其下存储了与变量A,B对应的值单元,C和D被分配。

著录项

  • 公开/公告号JPS6441934A

    专利类型

  • 公开/公告日1989-02-14

    原文格式PDF

  • 申请/专利权人 TOSHIBA CORP;

    申请/专利号JP19870197298

  • 发明设计人 AIKAWA TAKESHI;KOYAMA KIYOMI;

    申请日1987-08-08

  • 分类号G06F9/44;

  • 国家 JP

  • 入库时间 2022-08-22 06:44:43

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号