|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 5120 (0x1400) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Affectation_Ou_Appel, seg_0467d9
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000 └─⟦5a81ac88f⟧ »Space Info Vol 1« └─⟦this⟧
with Error, Dynamic_Node, Appel, Expression_Simple, Nom_Variable; package body Affectation_Ou_Appel is procedure Parse (List : in out Action_List.Object) is procedure The_Resynchro is new Error.Resynchro (Affectation_Ou_Appel.Is_Follow); use Lexical_Analyzer; Dyn_Node : Dynamic_Node.Object; begin if (Appel.Is_First (Lexical_Analyzer.Get_Token)) then Appel.Parse (List); if (Lexical_Analyzer.Get_Token /= Terminator) then Error.Set_Type_Error (Error.Point_Expected); raise Error.Excep_Syntaxe_Error; end if; Lexical_Analyzer.Next; elsif (Nom_Variable.Is_First (Lexical_Analyzer.Get_Token)) then Nom_Variable.Parse (Dyn_Node); Action_List.Create (List, Action_List.Affect_Action); Action_List.Set_Argument (List, Dyn_Node, Action_List.Target); if (Lexical_Analyzer.Get_Token /= Devient) then Error.Set_Type_Error (Error.Devient_Expected); raise Error.Excep_Syntaxe_Error; end if; Lexical_Analyzer.Next; Expression_Simple.Parse (Dyn_Node); Action_List.Set_Argument (List, Dyn_Node, Action_List.Source); if (Lexical_Analyzer.Get_Token /= Terminator) then Error.Set_Type_Error (Error.Point_Expected); raise Error.Excep_Syntaxe_Error; end if; Lexical_Analyzer.Next; else Error.Set_Type_Error (Error.Initialisation_False); raise Error.Excep_Syntaxe_Error; end if; exception when Error.Excep_Syntaxe_Error | Error.Excep_Semantic_Error => Error.Treat; The_Resynchro; end Parse; function Is_Follow (Un_Token : Lexical_Analyzer.Tokens) return Boolean is use Lexical_Analyzer; begin return ((Is_First (Un_Token)) or (Un_Token = Vie)); end Is_Follow; function Is_First (Un_Token : Lexical_Analyzer.Tokens) return Boolean is use Lexical_Analyzer; begin return ((Un_Token = Vider) or (Un_Token = Ajouter) or (Un_Token = Retirer) or (Un_Token = Ecrire) or (Un_Token = Quitter) or (Un_Token = Minus) or (Un_Token = Plus) or (Un_Token = Left_Bracket) or (Un_Token = Non) or (Un_Token = Identifier) or (Un_Token = String_Of_Characters) or (Un_Token = Integer_Number) or (Un_Token = Complement_Or_Verbe) or (Un_Token = Complement1) or (Un_Token = Complement2)); end Is_First; --function eval ; --functin unparse; end Affectation_Ou_Appel;
nblk1=4 nid=3 hdr6=6 [0x00] rec0=1a rec1=00 rec2=01 rec3=006 [0x01] rec0=17 rec1=00 rec2=02 rec3=02c [0x02] rec0=18 rec1=00 rec2=04 rec3=000 [0x03] rec0=0e rec1=00 rec2=03 rec3=000 tail 0x21543393486515b2642eb 0x42a00088462060003 Free Block Chain: 0x3: 0000 00 00 02 48 80 2f 20 28 55 6e 5f 54 6f 6b 65 6e ┆ H / (Un_Token┆