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

⟦ba3979006⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Terme, seg_048833

Derivation

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

with Error, Facteur;

package body Terme is


    procedure Parse (Dyn_Node : in out Dynamic_Node.Object) is
        use Lexical_Analyzer;  
        Inherited, Inherited1, Local_Node_Right : Dynamic_Node.Object;

    begin
        Facteur.Parse (Inherited);

        while ((Lexical_Analyzer.Get_Token = Multiplication) or
               (Lexical_Analyzer.Get_Token = Division) or
               (Lexical_Analyzer.Get_Token = Et)) loop

            case Lexical_Analyzer.Get_Token is
                when Multiplication =>
                    Dynamic_Node.Create_Binary_Operator
                       (Inherited1, Dynamic_Node.Multiply);

                when Division =>
                    Dynamic_Node.Create_Binary_Operator
                       (Inherited1, Dynamic_Node.Divide);

                when Et =>  
                    Dynamic_Node.Create_Binary_Operator
                       (Inherited1, Dynamic_Node.Logical_And);

                when others =>
                    null;
            end case;

            Lexical_Analyzer.Next;  
            Dynamic_Node.Set_Argument
               (Inherited1, Inherited, Dynamic_Node.Left);

            Facteur.Parse (Local_Node_Right);  
            Dynamic_Node.Set_Argument
               (Inherited1, Local_Node_Right, Dynamic_Node.Right);

            Inherited := Inherited1;
            Dynamic_Node.Disconnect (Inherited1);
            Dynamic_Node.Disconnect (Local_Node_Right);

        end loop;

        Dyn_Node := Inherited;

    end Parse;


    function Is_First (Un_Token : Lexical_Analyzer.Tokens) return Boolean is
        use Lexical_Analyzer;
    begin
        return ((Un_Token = Left_Bracket) or (Un_Token = Non) or
                (Un_Token = Integer_Number) or (Un_Token = Identifier) or
                (Un_Token = String_Of_Characters) or
                (Un_Token = Complement_Or_Verbe) or
                (Un_Token = Complement1) or (Un_Token = Complement2));
    end Is_First;


end Terme;

    nblk1=4
    nid=4
    hdr6=6
        [0x00] rec0=1f rec1=00 rec2=01 rec3=026
        [0x01] rec0=1e rec1=00 rec2=02 rec3=044
        [0x02] rec0=05 rec1=00 rec2=03 rec3=000
        [0x03] rec0=03 rec1=7e rec2=d8 rec3=442
    tail 0x21545c7e6865a3a191d48 0x42a00088462060003
Free Block Chain:
  0x4: 0000  00 00 00 e0 00 34 20 20 20 20 20 20 20 20 20 20  ┆     4          ┆