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

⟦3b9f695be⟧ Ada Source

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

Derivation

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

with Lex, Token_Pkg, Directions, Pieces, Error, Actions, Scenario, Structures;
use Token_Pkg;
package body Monde is
------------------------------------------------------------------------
-- <UNIT>        Monde
------------------------------------------------------------------------
--
-- <DESCRIPTION>    This package defines an operation for parsing the
--                  grammatical expresssion : <monde>
--
-- <AUTHOR>         Barthe Raphael, Beck Didier, Kempe Laurent
-- <VERSION>        1.0
-- <DATE>           16-Jan-94
-- <MODIFY>         16-Jan-95
--
-- <PKG USED>       LEX, Token_Pkg, Error, Directions, objets, pieces,
--                  liens, pnjs, hero, Actions, Scenario
--
------------------------------------------------------------------------

    procedure Parse (Success : in out Boolean) is
------------------------------------------------------------------------
-- <SUBPROGRAM>
-- <UNIT>        Parse
--
-- <DESCRIPTION> Try to parse <monde> and return if it was a success
--               or not.
--
-- <EXCEPTIONS>  Nothing
--
------------------------------------------------------------------------
        Ok : Boolean := True;
    begin

        if Lex.Currenttoken_Is (T_Directions) then
            Lex.Next;
            Directions.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Objets) then
            Lex.Next;
            Structures.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Pieces) then
            Lex.Next;
            Pieces.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Liens) then
            Lex.Next;
            Structures.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Pnjs) then
            Lex.Next;
            Structures.Parse (Ok);
            Success := Success and Ok;
        end if;

        if Lex.Currenttoken_Is (T_Hero) then
            Lex.Next;
            Structures.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Actions) then
            Lex.Next;
            Actions.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

        if Lex.Currenttoken_Is (T_Scenario) then
            Lex.Next;
            Scenario.Parse (Ok);
            Success := Success and Ok;
        else
            Success := False;
            Error.Append;
        end if;

    end Parse;

end Monde;

    nblk1=5
    nid=5
    hdr6=8
        [0x00] rec0=1b rec1=00 rec2=01 rec3=03a
        [0x01] rec0=24 rec1=00 rec2=02 rec3=034
        [0x02] rec0=24 rec1=00 rec2=03 rec3=036
        [0x03] rec0=09 rec1=00 rec2=04 rec3=000
        [0x04] rec0=09 rec1=00 rec2=04 rec3=001
    tail 0x217458e78863e8998fc3f 0x42a00088462060003
Free Block Chain:
  0x5: 0000  00 00 00 32 00 0f 20 20 20 20 20 20 20 20 65 6e  ┆   2          en┆