|
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 - downloadIndex: ┃ B T ┃
Length: 2210 (0x8a2)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─ ⟦129cab021⟧ »DATA«
└─⟦this⟧
with Lex, Error, Description_List, Symbol, Debug;
with Liste_Value;
with Body_Description;
package body Call_Sub_Routine is
procedure Parse (N : in out Binary_Tree.Node; Success : in out Boolean) is
N1 : Binary_Tree.Node;
Ok : Boolean := True;
begin
Success := True;
if Lex.Current_Token_Is (Lex.Executer) then
N1 := new Binary_Tree.Node_Structure;
N1.The_Type := Binary_Tree.Executer_Type;
Debug.Put (400);
Lex.Next;
if Lex.Current_Token_Is (Lex.Identifier) then
Debug.Put (401);
N1.S := new String'(Lex.Image);
Lex.Next;
if Lex.Current_Token_Is (Lex.Avec) then
Debug.Put (402);
Lex.Next;
if Lex.Current_Token_Is (Lex.Open_Bracket) then
Debug.Put (403);
Lex.Next;
Liste_Value.Parse (N1.Right_Son, Ok);
Success := Success and Ok;
if Lex.Current_Token_Is (Lex.Close_Bracket) then
Debug.Put (404);
Lex.Next;
else
Debug.Put (4000);
Error.Append (5);
Success := False;
end if;
else
Error.Append (6);
Success := False;
end if;
end if;
else
Error.Append (7);
Success := False;
end if;
N := N1;
end if;
end Parse;
procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
begin
Symbol.Set_Current_Level (To => 2, Function_Name => N.S.all);
if not Binary_Tree."=" (N.Right_Son, null) then
Liste_Value.Generate (N.Right_Son, 1);
end if;
Body_Description.Generate
(Symbol.Get_Start_Point (N.S.all).Right_Son, T);
Symbol.Set_Current_Level (To => 1, Function_Name => " ");
end Generate;
end Call_Sub_Routine;