Sometimes managing a more than three or four values on the stack leads to an excessive use of stack manipulation commands (the so-called stackrobatics) resulting in convolute code.

In these cases a compact subset of instructions, with a different syntax and based on the manipulation of a small number of global registers, may achieve greater clarity; this subset of the language, given its compact format, is called Assembly-like Instruction Set.

The Assembly-like Instruction Set is not meant as a separate programming language neither its features are intended to be sandboxed in exclusive environments: its statements can be freely intermingled with newRPL commands to suit anyone's programming style.

The programming paradigm is based on the manipulation of a small number of registers and pseudo-registers which act as top-level global variables, accessible anywhere in the code. It must be stressed that registers and pseudo-registers are totally distinct from any local or global identifier that shares the same name.

  • There are 8 proper registers, named A through H, free for the users to assign any object to them. These registers are global and persistent;
  • also, there are 7 pseudo-registers that correspond to the 7 topmost stack levels, named S1 through S7; these pseudo-registers are not persistent and exist only if the corresponding stack level is occupied by an object. If the stack is empty, read or write operations on e.g. S1 will trigger a Stack index out of bounds error.
  • finally there are 2 additional pseudo-registers: P and R.
    • any value assigned to P is pushed immediately to the stack, thus P can be used only as a destination register, not as an argument.
    • R references to the object immediately following it in the runstream. R cannot be used as a destination.

WARNING: all of these instructions are present in the specification but some of them may not be implemented yet at the time of the writing of this document.

Assembly-like statements must always start with a colon : and must not have any spaces within. Wherever a separator is needed, use the dot ..

Instructions are divided in the following classes:

Assignment Math (oper.) Math (functions) Tests Flow control Data manipulation

Literals are integer constants from 0 to 15. They can optionally be prefixed with a hash (#) or expressed in hexadecimal (#0H-#FH). In the latter case the leading # and trailing H are compulsory.

Statements are divided in two categories:

  • Assignments, which may have
    • an optional destination register (A-H, S1-S7 or P);
    • an optional assignment operator (=, +=, -=, *= or /=);
    • a math operator, a math function or a data manipulation command: operators are infix, functions and commands are prefix;
    • 1 or 2 arguments to the operator or function. Arguments can be either a (pseudo-)register (A-H, S1-S7), a reference (R) or a literal.
  • Commands, which may be
    • a comparison command, followed by the two arguments to be compared;
    • a flow control command, followed by the condition to be tested;
    • a data manipulation command, followed by two arguments defining the extent of the manipulation;
    • arguments can be either a register (A-H, S1-S7), a reference (R) or a literal.
:A=B+#1 Add 1 to the value of register B and assign the result to register A
:E=R { 1 2 3 } Store the list { 1 2 3 } in register E
:P=A Push the value of register A to the stack
:A=S2 :S2=S1 :S1=A Swap stack level 1 with level 2 using register A as temporary storage. An error is raised if the stack contains less than 2 levels
:C+=B^#2 Square the value register B and adds the result to register C
:B=R^#2 π Assign 'π^2' to register B. This example shows that register R must not necessarily be the second argument of a binary operator
:A+=ABS.S1 Add the absolute value of stack level 1 to the value of register A
:C*=SIN.A Compute the sine of register A and multiplies it with the content of register C
:D=ATANH.R 'e^2' Assign the hyperbolic arctangent of 'e^2' to register D

Test instructions will, when the result is not stored or assigned to any register, affect two system flags: flag -58 if the result of the test was zero (in the case of CMP, if the two arguments are equal) and flag -59 if the result is negative (in the case of CMP, when the first argument is less than the second).

The CMP command is equivalent to the newRPL CMP operator and accepts the same type of arguments.

:CMP.A.#1 Compare register A and literal 1, setting internal flags accordingly
:C=CMP.A.#1 Compare register A and literal 1, store the result of the comparison in C. In this case internal flags will not be set.
:AND.A.#1 Logical AND between A and literal 1 (always true), therefore resulting in 0 (false) if A is false, true otherwise. Internal flags will be set accordingly.
:C=AND.A.#1 Same as above, store the result of the test (true/false) in C. In this case internal flags will not be set.

The following commands accept one argument expressing a test condition. the argument expresses mnemonically the state of flags -58 and -59, according to the following table.

Mnemonic Test condition Flag -58 (Zero) Flag -59 (Negative)
AL Always
LT Less Than Set
EQ or Z Equals Set
LE Less Than or Equals Set
NA Never
GE Greater Than or Equals Clear
NE or NZ Not Equals Clear
GT Greater Than Clear Clear

:SKIP.EQ Skip next instruction if the state of the flags was Equals
:LOOP.LE Must be followed by a program « … » or a secondary :: … ;. Repeat the object that follows while the state of the flags is Less Than or Equals. Notice the program or secondary that follows must update the internal flags with a :CMP.[Y].[Z] or other test statement or it will loop indefinitely
:A=CHK.GT Results in true (1) if the state of flags is Greater Than, otherwise results in False (0). Result may be stored into a register or pseudo-register. If the result is not stored, flags will be affected accordingly

The CHK command is useful to combine assembly-like statements into newRPL flow control structures. For example

« IF 
    :CMP.A.#3    @@ COMPARE A WITH 3

These instructions allow manipulation of composite objects (lists, vectors and matrices) as well data retrieval or storage from and to the stack, therefore some of them are assignments and others are commands.

:A=GET.S2.#5 Retrieve the 5th element of the composite stored at stack level 2 and store it in register A
:C=PUT.#3.R 9 Store the object on the ninth level of stack at third position of the composite stored in register C. In other words C(3)=S9
:A=POP.S1.#3 Remove values from the stack (pop) from the given stack levels and store the values on registers A, B, C… starting with A, and as many values as needed. The example given will assign :A=S1, :B=S2 and :C=S3, while also removing the values from the stack.
:A=RPOP.S1.#3 Similar to :POP but the assignment is done in reverse order. In this example will do :A=S3, :B=S2, and :C=S1
:PUSH.A.#3 Reverse of :POP. In this example will do :P=C, :P=B and :P=A
:RPUSH.A.#3 Reverse of :RPOP. In this example will do :P=A, :P=B, and :P=C
:CLR.A.#3 Set registers to zero (clear) starting with A, and as many registers as requested. In this example will do :A=0, :B=0 and :C=0

The following programs show the Assembly-like Instruction Set features in action: they are meant to be didactic rather than clever.

  • Q2 is an almost line-per-line translation of the program presented in chapter 2 of the HP-42S Programming Examples and Techniques manual.
« @@ Q2: Solve aX^2+bX+c=0 where a≠0, c≠0
  -103 SF             @ Complex results
  :A=RPOP.S1.#3       @ Store coefficients in registers
  :AND.A.C            @ Are either zero?
  :SKIP.NZ            @ Skip next seco if both A and C were non-zero
  :: "Zero Input Invalid"
     DOERR            @ Abort with error
  :D=#0-B             @ -B
  :E=B*B              @ B^2
  :F=#4*A :F*=C       @ 4*A*C
  :E-=F   :E=SQRT.E   @ √(B^2-4*A*C)
  :SKIP.GE :F=D+E     @ -B+√(B^2-4*A*C) when B<=0
  :SKIP.LT :F=D-E     @ -B-√(B^2-4*A*C) when B>0
  :E=A*#2             @ 2*A
  :P=F/E              @ (-B-SIGN(B)*√(B^2-4*A*C))/2/A is R1, the largest root in absolute value
  :P=C/A              @ R1, C/A
  :S1/=S2             @ C/(R1*A) is R2, the other root

  • STRAIGHT computes the equation of the straight line passing through the points p1=(x1,y1) and p2=(x2,y2).
« @@ STRAIGHT: compute aX+bY+c passing through p1 and p2
  → p1 p2         @ Get the two points
  « p1 C→R        @ Split the first
    p2 C→R        @ Split the second
    :C=RPOP.S1.#4 @ Store x1, y1, x2 and y2 in C, D, E and F registers
    :A=R 'X'      @ Registers can store anything
    :B=R 'Y'      @ if 'R' pseudo-register is used
    :B-=D         @ B='Y-y1'
    :A-=C         @ A='X-x1'
    :F-=D         @ F=y2-y1
    :E-=C         @ E=x2-x1
    :B*=E         @ B='(Y-y1)*(x2-x1)'
    :F*=A         @ F='(y2-y1)*(X-x1)'
    :B-=F         @ B='(Y-y1)*(x2-x1)-(y2-y1)*(X-x1)'
    :P=B          @ Push result on the stack
  • manual/chapter5/asm.txt
  • Last modified: 2021/09/29 05:58
  • by jojo1973