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 - download

⟦8abf577f4⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Facteur_Cond, seg_046488, seg_0464f7

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⟧ 

E3 Source Code



with Lexical, Token_List, Erreur, Exp_Cond, Corps_Cond, Test, Liste_Des_Entrees;
with Models, Symbols, Comps_Dictionary, Verbs_Dictionary;
with Abstract_Tree, Bounded_String;

use Lexical, Token_List, Bounded_String;

package body Facteur_Cond is

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

        Node1, Node2 : Abstract_Tree.Object;
        Operation : Token;
        Entree1, Entree2, Entree3 : Variable_String (32);
    begin

        if Is_In (Lexical.Get_Token, Corps_Cond.First) then
            Corps_Cond.Parse (Node1, Models_Table, Symbols_Table);
            Test.Parse (Operation);
            Corps_Cond.Parse (Node2, Models_Table, Symbols_Table);
            Node := Abstract_Tree.Make_Node (Operation, Node1, Node2);
        else
            case Lexical.Get_Token is

                when Parnto =>
                    Lexical.Next;
                    Exp_Cond.Parse (Node, Models_Table,
                                    Symbols_Table, Comp, Dict);
                    if Lexical.Get_Token = Parntf then
                        Lexical.Next;
                    else
                        Erreur.Syntaxe ("Manque )");
                    end if;

                when Crocho =>

                    Lexical.Next;
                    Liste_Des_Entrees.Parse
                       (Comp, Dict, Entree1, Entree2, Entree3);
                    Node := Abstract_Tree.Make_Node
                               (Image (Entree1), Image (Entree2),
                                Image (Entree3));
                    if Lexical.Get_Token = Crochf then
                        Lexical.Next;
                    else
                        Erreur.Syntaxe ("Manque ]");
                    end if;

                when others =>
                    Erreur.Syntaxe ("Condition Incorrecte");

            end case;
        end if;

    end Parse;

end Facteur_Cond;





E3 Meta Data

    nblk1=4
    nid=0
    hdr6=8
        [0x00] rec0=1a rec1=00 rec2=01 rec3=00a
        [0x01] rec0=01 rec1=00 rec2=04 rec3=018
        [0x02] rec0=1a rec1=00 rec2=02 rec3=016
        [0x03] rec0=0e rec1=00 rec2=03 rec3=000
    tail 0x21748a74486503d64dbb2 0x42a00088462060003