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: 3842 (0xf02) Types: TextFile Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11 └─ ⟦129cab021⟧ »DATA« └─⟦this⟧
separate (Parse) procedure Parse_Les_Ordres (Ok : out Boolean; The_List : in out Abstract_Tree.P_Instruction_List) is Ok1 : Boolean := True; The_Node : Abstract_Tree.P_Node; begin Ok := True; Text_Io.Put_Line ("parse_les_ordres"); while Lex.Get_Token /= L_Puis and Lex.Get_Token /= L_Fin loop case Lex.Get_Token is when L_Dans => Parse_Dans (Ok1, The_Node); if not Ok1 then Parse_Error (Dans_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Tantque => Parse_Tant_Que (Ok1, The_Node); if not Ok1 then Parse_Error (Tant_Que_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Attendre => Parse_Attendre (Ok1, The_Node); if not Ok1 then Parse_Error (Attendre_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Repeter => Parse_Repeter (Ok1, The_Node); if not Ok1 then Parse_Error (Repeter_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Debut => Parse_Debut (Ok1, The_Node); if not Ok1 then Parse_Error (Debut_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Activer => Parse_Activer (Ok1, The_Node); if not Ok1 then Parse_Error (Activer_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Desact => Parse_Desactiver (Ok1, The_Node); if not Ok1 then Parse_Error (Desactiver_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Changer => Parse_Changer (Ok1, The_Node); if not Ok1 then Parse_Error (Changer_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Evoluer => Parse_Evoluer (Ok1, The_Node); if not Ok1 then Parse_Error (Evoluer_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Id => Parse_Affectation (Ok1, The_Node); if not Ok1 then Parse_Error (Affectation_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Appel_Effet => Parse_Appel_Effet (Ok1, The_Node); if not Ok1 then Parse_Error (Appel_Effet_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when L_Lancer_Scene => Parse_Appel_Scene (Ok1, The_Node); if not Ok1 then Parse_Error (Appel_Scene_Follow); else Abstract_Tree.Add_The_List (The_List, The_Node); end if; when others => Ok := False; exit; end case; end loop; Text_Io.Put_Line ("fin les ordres"); end Parse_Les_Ordres;