|
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: 1474 (0x5c2)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─ ⟦129cab021⟧ »DATA«
└─⟦this⟧
separate (Parse)
procedure Parse_Repeter (Ok : out Boolean;
The_Node : out Abstract_Tree.P_Node) is
Ok1 : Boolean := True;
The_List : Abstract_Tree.P_Instruction_List;
Expr_Node : Abstract_Tree.P_Node;
begin
Abstract_Tree.Create_List (The_List);
Ok := True;
Text_Io.Put_Line ("parse_repeter");
if Lex.Get_Token = L_Repeter then
Lex.Next;
Parse_Expression (Ok1, Expr_Node);
if not Ok1 then
Parse_Error (Expr_Follow);
end if;
if Lex.Get_Token = L_Fois then
Lex.Next;
Parse_Les_Ordres (Ok1, The_List);
if not Ok1 then
Parse_Error (Les_Ordres_Follow);
else
The_Node := Abstract_Tree.Make_Node
(L_Repeter, Expr_Node, The_List);
end if;
if Lex.Get_Token = L_Fin then
Lex.Next;
if Lex.Get_Token = L_Repeter then
Lex.Next;
else
Ok := False;
The_Node := Abstract_Tree.Empty_Node;
end if;
else
Ok := False;
The_Node := Abstract_Tree.Empty_Node;
end if;
else
Ok := False;
The_Node := Abstract_Tree.Empty_Node;
end if;
else
Ok := False;
The_Node := Abstract_Tree.Empty_Node;
end if;
end Parse_Repeter;