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

⟦d5f737f62⟧ Ada Source

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

Derivation

└─⟦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, Liste_Arguments,
     Un_Mot_Du_Voca, Nom_Variable, Action_List;

package body Appel is


    procedure Parse is  
        use Lexical_Analyzer;
        At_Dyn_Node, What_Dyn_Node : Dynamic_Node.Object;


        List : Action_List.Object;
    begin
        case (Lexical_Analyzer.Get_Token) is

            when Ecrire =>
                Lexical_Analyzer.Next;
                Action_List.Create (List, Action_List.Write_Action);
                Liste_Arguments.Parse (List);

            when Retirer =>  
                Lexical_Analyzer.Next;  
                Action_List.Create (List, Action_List.Remove_From_Set_Of_Word);
                Un_Mot_Du_Voca.Parse (What_Dyn_Node);
                Action_List.Set_Argument
                   (List, What_Dyn_Node, Action_List.Source);
                if (Lexical_Analyzer.Get_Token /= A) then
                    Error.Set_Type_Error (Error.A_Expected);
                    raise Error.Excep_Syntaxe_Error;
                end if;
                Lexical_Analyzer.Next;
                Nom_Variable.Parse (At_Dyn_Node);
                Action_List.Set_Argument
                   (List, At_Dyn_Node, Action_List.Target);

            when Ajouter =>
                Lexical_Analyzer.Next;
                Action_List.Create (List, Action_List.Append_In_Set_Of_Word);
                Un_Mot_Du_Voca.Parse (What_Dyn_Node);
                Action_List.Set_Argument
                   (List, What_Dyn_Node, Action_List.Source);
                if (Lexical_Analyzer.Get_Token /= A) then  
                    Error.Set_Type_Error (Error.A_Expected);
                    raise Error.Excep_Syntaxe_Error;
                end if;
                Lexical_Analyzer.Next;
                Nom_Variable.Parse (At_Dyn_Node);
                Action_List.Set_Argument
                   (List, At_Dyn_Node, Action_List.Target);

            when Vider =>
                Lexical_Analyzer.Next;
                Action_List.Create (List, Action_List.Clear_Set_Of_Word);
                Nom_Variable.Parse (At_Dyn_Node);
                Action_List.Set_Argument
                   (List, At_Dyn_Node, Action_List.Target);

            when Quitter =>  
                Action_List.Create (List, Action_List.Quit_Action);
                Lexical_Analyzer.Next;

            when others =>
                null;
                -- pas erreur car action.parse utilise appel que apres avoir teste les first de appel
        end case;
    exception
        when Lexical_Analyzer.Excep_Eof =>
            Error.Set_Type_Error (Error.Unexpected_Eof);
            Error.Treat;
            raise Error.Excep_Syntaxe_Aborded;
    end Parse;


    function Is_First (Un_Token : Lexical_Analyzer.Tokens) return Boolean is
        use Lexical_Analyzer;
    begin
        return ((Un_Token = Ecrire) or (Un_Token = Retirer) or
                (Un_Token = Ajouter) or
                (Un_Token = Vider) or (Un_Token = Quitter));
    end Is_First;


end Appel;

    nblk1=5
    nid=0
    hdr6=a
        [0x00] rec0=1e rec1=00 rec2=01 rec3=036
        [0x01] rec0=00 rec1=00 rec2=02 rec3=01a
        [0x02] rec0=17 rec1=00 rec2=04 rec3=034
        [0x03] rec0=1a rec1=00 rec2=03 rec3=048
        [0x04] rec0=06 rec1=00 rec2=05 rec3=000
    tail 0x21542139c864b880feab6 0x42a00088462060003