DataMuseum.dk

top - download

    Length: 1706 (0x6aa)
    Types: TextFile
    Names: »B«

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 

TextFile

with Text_Io;
with Lex;
with Object;
with Binary;
with Error_Broadcaster;
with More_Value;
package body 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; Error : out Boolean) is
        Failed : Boolean := False;

    begin
        N := new Node_Structure;
        Binary.Parse (N.Bin, Failed);
        if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                             Lex.Token'Pos (Lex.Key_Word) then
            N.Rule := 1;
            More_Value.Parse (N.More, Failed);
        end if;
        if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                             Lex.Token'Pos (Lex.Prendre) then
            raise Error_Broadcaster.Pour_Is_Missing;
        end if;
        Error := Failed;
    end Parse;

    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return Binary.Is_First (T);

    end Is_First;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is

        Result : Object.Reference;
        This_List : Object.Parameters.List;

    begin
        case N.Rule is
            when 0 =>
                Result := Binary.Interpret (N.Bin);
            when 1 =>
                Result := Binary.Interpret (N.Bin);

                More_Value.Interpret (N.More, This_List);
                Result := Object.Send (Result, This_List);
        end case;
        return Result;
    end Interpret;
end Value;