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

⟦52753a773⟧ Ada Source

    Length: 6144 (0x1800)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Variable, seg_0462d7

Derivation

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

with Error, Initialisation_Par_Agregats,
     Unbounded_String, Variable_Table, Dynamic_Value;

package body Variable is


    procedure Parse is
        procedure The_Resynchro is new Error.Resynchro (Variable.Is_Follow);
        use Lexical_Analyzer;
        package Unlimited_String is new Unbounded_String (10);
        Name : Unlimited_String.Variable_String;
    begin
        if not (Variable.Is_First (Lexical_Analyzer.Get_Token)) then
            Error.Set_Type_Error (Error.Decl_Variable_Expected);
            raise Error.Excep_Syntaxe_Error;
        end if;
        Name := Unlimited_String.Value (Lexical_Analyzer.Get_Value);
        Lexical_Analyzer.Next;
        if (Lexical_Analyzer.Get_Token /= Comme) then
            Error.Set_Type_Error (Error.Comme_Expected);
            raise Error.Excep_Syntaxe_Error;
        end if;
        Lexical_Analyzer.Next;
        case (Lexical_Analyzer.Get_Token) is
            when Identifier =>  
                Variable_Table.Create (Unlimited_String.Image (Name),
                                       Lexical_Analyzer.Get_Value,
                                       Lexical_Analyzer.Get_Line_In_File,
                                       Lexical_Analyzer.Get_Position_In_Line);
                Lexical_Analyzer.Next;
            when Entier =>  
                Variable_Table.Create (Unlimited_String.Image (Name),
                                       Dynamic_Value.Integer_Number,
                                       Lexical_Analyzer.Get_Line_In_File,
                                       Lexical_Analyzer.Get_Position_In_Line);
                Lexical_Analyzer.Next;
            when Chaine =>
                Variable_Table.Create (Unlimited_String.Image (Name),
                                       Dynamic_Value.String_Of_Characters,
                                       Lexical_Analyzer.Get_Line_In_File,
                                       Lexical_Analyzer.Get_Position_In_Line);
                Lexical_Analyzer.Next;
            when others =>
                Error.Set_Type_Error (Error.Type_Unknown);
                raise Error.Excep_Syntaxe_Error;
        end case;

        Initialisation_Par_Agregats.Parse;
        if (Lexical_Analyzer.Get_Token /= Terminator) then
            Error.Set_Type_Error (Error.Point_Expected);
            raise Error.Excep_Syntaxe_Error;
        end if;
        Lexical_Analyzer.Next;

    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 = Initialisations) 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 = Identifier);
    end Is_First;


    --function eval ;
    --functin unparse;

end Variable;

    nblk1=5
    nid=3
    hdr6=8
        [0x00] rec0=1b rec1=00 rec2=01 rec3=01a
        [0x01] rec0=0f rec1=00 rec2=05 rec3=082
        [0x02] rec0=1f rec1=00 rec2=02 rec3=022
        [0x03] rec0=0a rec1=00 rec2=04 rec3=000
        [0x04] rec0=09 rec1=00 rec2=03 rec3=000
    tail 0x21542d11486503cd488fe 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 00 8b 00 27 20 20 20 20 20 20 20 20 72 65  ┆     '        re┆