|
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: 1472 (0x5c0)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─⟦129cab021⟧ »DATA«
└─⟦this⟧
separate (Parse)
procedure Parse_Tant_Que (Ok : out Boolean;
The_Node : out Abstract_Tree.P_Node) is
Ok1 : Boolean := True;
The_List : Abstract_Tree.P_Instruction_List;
Cond1_Node, Cond2_Node, Relation_Node : Abstract_Tree.P_Node;
begin
The_Node := Abstract_Tree.Empty_Node;
Abstract_Tree.Create_List (The_List);
Ok := True;
Text_Io.Put_Line ("parse_tant_que");
if Lex.Get_Token = L_Tantque then
Lex.Next;
Parse_Condition (Ok1, Cond1_Node, Relation_Node, Cond2_Node);
if not Ok1 then
Parse_Error (Condition_Follow);
end if;
if Lex.Get_Token = L_Faire 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_Tantque, Cond1_Node, Relation_Node,
Cond2_Node, The_List);
end if;
if Lex.Get_Token = L_Fin then
Lex.Next;
if Lex.Get_Token = L_Tantque then
Lex.Next;
else
Ok := False;
end if;
else
Ok := False;
end if;
else
Ok := False;
end if;
else
Ok := False;
end if;
Text_Io.Put_Line ("fin tant que");
end Parse_Tant_Que;