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

⟦ae23a5b76⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Arguments, seg_038f26, seg_038f37

Derivation

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

with Lex;
with Object;
with List;
with Error_Broadcaster;
with Unparser;
package body Arguments is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Lst : List.Node := List.Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;

    begin
        N := new Node_Structure;
        case Lex.Get_Token is

            when Lex.Avec =>
                N.Rule := 1;
                Lex.Next_Token;
                List.Parse (N.Lst, Failed);
                if not Failed then
                    if Lex.Token'Pos (Lex.Get_Token) =
                       Lex.Token'Pos (Lex.Dot) then
                        Lex.Next_Token;
                    else
                        raise Error_Broadcaster.Dot_Is_Missing;
                    end if;
                end if;

            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Unparser.Put ("avec ");
                List.Unparse (N.Lst);
                Unparser.Put (".");
                Unparser.Put_Line ("");
        end case;
    end Unparse;

    procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is

    begin
        List.Set (N.Lst, The_Argument);
    end Set;


end Arguments;

    nblk1=4
    nid=2
    hdr6=4
        [0x00] rec0=24 rec1=00 rec2=01 rec3=016
        [0x01] rec0=1a rec1=00 rec2=04 rec3=000
        [0x02] rec0=03 rec1=00 rec2=02 rec3=000
        [0x03] rec0=02 rec1=a1 rec2=f4 rec3=442
    tail 0x21531fb6084e875cc15db 0x42a00088462060003
Free Block Chain:
  0x2: 0000  00 03 00 17 00 0e 65 6e 64 20 41 72 67 75 6d 65  ┆      end Argume┆
  0x3: 0000  00 00 00 a3 80 3b 28 4e 20 3a 20 4e 6f 64 65 3b  ┆     ;(N : Node;┆