DataMuseum.dk

top - download

    Length: 1812 (0x714)
    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 More_Binary;
with Unary;
with Unparser;
package body Binary is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Una : Unary.Node := Unary.Empty_Node;
            More : More_Binary.Node := More_Binary.Empty_Node;

        end record;

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

    begin
        N := new Node_Structure;
        if Unary.Is_First (Lex.Get_Token) then
            N.Rule := 0;
            Unary.Parse (N.Una, Failed);
            if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                 Lex.Token'Pos (Lex.Binary_Message) then
                N.Rule := 1;
                More_Binary.Parse (N.More, Failed);
            end if;
        end if;


        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>

                Unary.Unparse (N.Una);
            when 1 =>
                Unary.Unparse (N.Una);
                More_Binary.Unparse (N.More);
        end case;
    end Unparse;


    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return Unary.Is_First (T);
    end Is_First;
    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        case N.Rule is
            when 0 =>
                Result := Unary.Interpret (N.Una);
            when 1 =>
                Result := Unary.Interpret (N.Una);
                Result := More_Binary.Interpret (N.More, Result);
        end case;  
        return Result;
    end Interpret;
end Binary;