|
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: 1883 (0x75b)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─ ⟦129cab021⟧ »DATA«
└─⟦this⟧
with Lex, Error, Debug, Symbol;
with Case_List;
package body Case_Structure 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.Selon) then
N1 := new Binary_Tree.Node_Structure;
N1.The_Type := Binary_Tree.Selon_Type;
Debug.Put (260);
Lex.Next;
if Lex.Current_Token_Is (Lex.Identifier) then
N1.S := new String'(Lex.Image);
Debug.Put (261);
Lex.Next;
if Lex.Current_Token_Is (Lex.Est) then
Debug.Put (262);
Lex.Next;
Case_List.Parse (N1.Right_Son, Ok);
Success := Success and Ok;
if Lex.Current_Token_Is (Lex.Fin) then
Debug.Put (263);
Lex.Next;
if Lex.Current_Token_Is (Lex.Selon) then
Debug.Put (264);
Lex.Next;
else
Error.Append (27);
Success := False;
end if;
else
Error.Append (28);
Success := False;
end if;
else
Error.Append (29);
Success := False;
end if;
else
Error.Append (30);
Success := False;
end if;
N := N1;
end if;
end Parse;
procedure Generate (N : Binary_Tree.Node; T : in out Natural) is
begin
Case_List.Generate (N.Right_Son, T, N.S.all);
end Generate;
end Case_Structure;