|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - download
Length: 4096 (0x1000)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Expression, seg_038b4e
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Lex, Error, Symbol, Debug;
with Term;
package body Expression is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1, N2 : Binary_Tree.Node;
Ok : Boolean := True;
begin
N1 := new Binary_Tree.Node_Structure;
N := N1;
Success := True;
Term.Parse (N1.Left_Son, Ok);
while (Lex.Current_Token_In ((Lex.Plus, Lex.Minus))) loop
N2 := new Binary_Tree.Node_Structure;
N1.Right_Son := N2;
case Lex.Get is
when Lex.Plus =>
Debug.Put (530);
Lex.Next;
N1.The_Type := Binary_Tree.Add_Type;
Term.Parse (N2.Left_Son, Ok);
Success := Success and Ok;
when Lex.Minus =>
Debug.Put (531);
Lex.Next;
N1.The_Type := Binary_Tree.Sub_Type;
Term.Parse (N2.Left_Son, Ok);
Success := Success and Ok;
when others =>
Error.Append (2);
Success := False;
end case;
N1 := N2;
end loop;
end Parse;
procedure Generate (N : in out Binary_Tree.Node;
The_Value : in out Natural) is
Value1, Value2 : Natural;
begin
Term.Generate (N.Left_Son, Value1);
if Binary_Tree."=" (N.Right_Son, null) then
The_Value := Value1;
else
Generate (N.Right_Son, Value2);
case N.The_Type is
when Binary_Tree.Add_Type =>
The_Value := Value1 + Value2;
when Binary_Tree.Sub_Type =>
The_Value := Value1 - Value2;
when others =>
null;
end case;
end if;
end Generate;
end Expression;
nblk1=3
nid=0
hdr6=6
[0x00] rec0=1c rec1=00 rec2=01 rec3=022
[0x01] rec0=20 rec1=00 rec2=02 rec3=012
[0x02] rec0=02 rec1=00 rec2=03 rec3=000
tail 0x2173664c484e83912fe4c 0x42a00088462060003