|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 Tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: B T
Length: 1388 (0x56c)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─⟦129cab021⟧ »DATA«
└─⟦this⟧
with Lex, Primitives;
with Debug;
package body Primitives_List is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1 : Binary_Tree.Node;
Ok : Boolean := True;
begin
N1 := new Binary_Tree.Node_Structure;
N1.The_Type := Binary_Tree.L_Primitives_Type;
Success := True;
Primitives.Parse (N1.Left_Son, Ok);
Success := Success and Ok;
if Lex.Current_Token_In ((Lex.Activer, Lex.Desactiver,
Lex.Fixer, Lex.Evoluer)) then
Parse (N1.Right_Son, Ok);
Success := Success and Ok;
end if;
N := N1;
end Parse;
procedure Generate
(N : Binary_Tree.Node; T : in out Natural; S : in String) is
begin
Debug.Put (3333);
case N.Left_Son.The_Type is
when Binary_Tree.Null_Type =>
Generate (N.Right_Son, T, S);
when Binary_Tree.Activer_Type | Binary_Tree.Desactiver_Type |
Binary_Tree.Fixer_Type | Binary_Tree.Evoluer_Type =>
Primitives.Generate (N.Left_Son, T, S);
if not Binary_Tree."=" (N.Right_Son, null) then
Generate (N.Right_Son, T, S);
end if;
when others =>
null;
end case;
end Generate;
end Primitives_List;