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

⟦78bda87c6⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Definitions, seg_040d90

Derivation

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

E3 Source Code



with Lexical, Erreur, Definitions_Simples, Noms;
use Lexical;

package body Definitions is


    procedure Definition is
    begin
        case Lexical.Get_Token is

            when Structure =>
                Lexical.Next;
                if (Lexical.Get_Token = Id) then
                    Lexical.Next;
                    if (Lexical.Get_Token = Parnto) then
                        Lexical.Next;
                        Definitions_Simples.Parse;
                        if (Lexical.Get_Token = Parntf) then
                            Lexical.Next;
                        else
                            Erreur.Parse ("Manque )");
                        end if;
                    else
                        Erreur.Parse ("Manque (");
                    end if;
                else
                    Erreur.Parse ("Manque Nom de structure");
                end if;

            when Enumere =>
                Lexical.Next;
                if (Lexical.Get_Token = Id) then
                    Lexical.Next;
                    if (Lexical.Get_Token = Parnto) then
                        Lexical.Next;
                        Noms.Parse;
                        if (Lexical.Get_Token = Parntf) then
                            Lexical.Next;
                        else
                            Erreur.Parse ("Manque )");
                        end if;
                    else
                        Erreur.Parse ("Manque (");
                    end if;
                else
                    Erreur.Parse ("Manque Nom de enumere");
                end if;

            when others =>
                Erreur.Parse ("Manque Enumere/Structure");
        end case;

    end Definition;


    function Is_In_First (T : Token) return Boolean is
    begin
        case T is
            when Structure | Enumere =>
                return True;
            when others =>
                return False;
        end case;
    end Is_In_First;


    procedure Parse is
    begin

        Definition;

        while (Is_In_First (Lexical.Get_Token)) loop

            Definition;

        end loop;

    end Parse;

end Definitions;



E3 Meta Data

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=21 rec1=00 rec2=01 rec3=010
        [0x01] rec0=1e rec1=00 rec2=02 rec3=020
        [0x02] rec0=15 rec1=00 rec2=03 rec3=001
    tail 0x2153b857e861262124b4e 0x42a00088462060003