DataMuseum.dk

top - download

    Length: 1346 (0x542)
    Types: TextFile
    Names: »B«

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─ ⟦d65440be7⟧ »DATA« 
        └─⟦this⟧ 

TextFile

with Scanner;
with Object;
with Binary;

package body More_Value is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Bin : Binary.Node := Binary.Empty_Node;
            More : More_Value.Node := More_Value.Empty_Node;
        end record;

    procedure Parse (N : in out Node;
                     Mess : in out Object.Keyword;
                     Error : out Boolean) is
        Failed : Boolean := False;
        M : Object.Keyword;
        use Scanner;
    begin  
        N := new Node_Structure;
        N.Rule := 0;
        Object.Put (Scanner.Get_Value, Mess);
        Scanner.Next;
        Binary.Parse (N.Bin, Failed);
        if not Failed and then Scanner.Get_Token = Scanner.Keyword then
            N.Rule := 1;
            More_Value.Parse (N.More, Mess, Failed);
        end if;  
        Error := Failed;
    end Parse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Keyword;
    end Is_First;

    procedure Interpret (N : Node; Mess : in out Object.Keyword) is
        Result : Object.Reference;
    begin
        Result := Binary.Interpret (N.Bin);
        Object.Put (Result, Mess);
        if N.Rule = 1 then
            More_Value.Interpret (N.More, Mess);
        end if;
    end Interpret;
end More_Value;