|
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 - metrics - download
Length: 3072 (0xc00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Condition, seg_0389ce
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Value, Relational_Operator, Binary_Tree, Symbol;
package body Condition is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1 : Binary_Tree.Node;
Ok : Boolean := True;
Relation_Type : Binary_Tree.Node_Type;
begin
N1 := new Binary_Tree.Node_Structure;
Value.Parse (N1.Left_Son, Ok);
Success := Success and Ok;
Relational_Operator.Parse (Relation_Type, Ok);
N1.The_Type := Relation_Type;
Success := Success and Ok;
Value.Parse (N1.Right_Son, Ok);
Success := Success and Ok;
N := N1;
end Parse;
function Generate (N : Binary_Tree.Node) return Boolean is
Var1, Var2 : Natural;
The_Type : Symbol.Symbol_Type;
Ok : Boolean := True;
begin
Symbol.Get_Variable (N.Left_Son.S.all, The_Type, Var1, Ok);
Symbol.Get_Variable (N.Right_Son.S.all, The_Type, Var2, Ok);
case N.The_Type is
when Binary_Tree.Equal_Type =>
return Var1 = Var2;
when Binary_Tree.Greater_Or_Equal_Type =>
return Var1 >= Var2;
when Binary_Tree.Greater_Than_Type =>
return Var1 > Var2;
when Binary_Tree.Less_Than_Type =>
return Var1 < Var2;
when Binary_Tree.Less_Or_Equal_Type =>
return Var1 <= Var2;
when Binary_Tree.Not_Equal_Type =>
return Var1 /= Var2;
when others =>
null;
end case;
end Generate;
end Condition;
nblk1=2
nid=0
hdr6=4
[0x00] rec0=1d rec1=00 rec2=01 rec3=014
[0x01] rec0=15 rec1=00 rec2=02 rec3=001
tail 0x217354aa684e569c5cd99 0x42a00088462060003