DataMuseum.dk Presents historical artifacts from the history of: Rational R1000/400

This is an automatic "excavation" of a thematic subset of artifacts from Datamuseum.dk's BitArchive. See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software.

top - metrics - download

⟦d69facaf0⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Expression_Generale, seg_048fe6, seg_0493b4

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─⟦5a81ac88f⟧ »Space Info Vol 1« 
        └─⟦this⟧ 
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─⟦cfc2e13cd⟧ »Space Info Vol 2« 
        └─⟦this⟧ 

with Lexical, Token_List, Erreur, Expression,
     Facteur, Nom_De_Variable, Token_List;
with Models, Symbols, Bounded_String, Abstract_Tree;

use Lexical, Token_List, Bounded_String;

package body Expression_Generale is

    Follow : Token_List.Object :=
       Token_List.Make ((Si, Comp, Id, Lie_Connexion, Delie_Connexion,
                         Lie_Lien, Delie_Lien, Liste_Lien, Echanger_Lien,
                         Afficher, Fin, Sinon, Finsi, Finpour));

    procedure Parse (Node : in out Abstract_Tree.Object;
                     Models_Table : Models.Object;
                     Symbols_Table : Symbols.Object) is

        Param1, Param2 : Variable_String (32);
        Instruction : Token;
    begin
        if Is_In (Lexical.Get_Token, Expression.First) then
            Expression.Parse (Node, Models_Table, Symbols_Table);
        else
            Instruction := Lexical.Get_Token;
            if Lexical.Get_Token = Destination_Connexion then
                Lexical.Next;
                if Lexical.Get_Token = Parnto then
                    Lexical.Next;
                    Nom_De_Variable.Parse (Param1);
                    if Lexical.Get_Token = Virgul then
                        Lexical.Next;
                        Nom_De_Variable.Parse (Param2);
                        if Lexical.Get_Token = Parntf then
                            Lexical.Next;
                            Node := Abstract_Tree.Make_Node
                                       (Instruction, Image (Param1),
                                        Image (Param2));
                        else
                            Erreur.Syntaxe ("Manque )", Follow);
                            Node := Abstract_Tree.Make_Node (0);
                        end if;
                    else
                        Erreur.Syntaxe ("Manque ,", Follow);
                        Node := Abstract_Tree.Make_Node (0);
                    end if;
                else
                    Erreur.Syntaxe ("Manque )", Follow);
                    Node := Abstract_Tree.Make_Node (0);
                end if;
            else
                Erreur.Syntaxe
                   ("Mauvaise expression/fonction lors de l affectation",
                    Follow);
                Node := Abstract_Tree.Make_Node (0);
            end if;
        end if;

    end Parse;

end Expression_Generale;

    nblk1=4
    nid=0
    hdr6=8
        [0x00] rec0=1a rec1=00 rec2=01 rec3=07a
        [0x01] rec0=02 rec1=00 rec2=03 rec3=064
        [0x02] rec0=15 rec1=00 rec2=02 rec3=016
        [0x03] rec0=13 rec1=00 rec2=04 rec3=000
    tail 0x2174d4e8a865b3db70277 0x42a00088462060003