DataMuseum.dk

top - download

    Length: 1654 (0x676)
    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 Bounded_String;
package body More_Unary is
    subtype Message is String;
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            More : More_Unary.Node := More_Unary.Empty_Node;
            Mess : Object.Message;
        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.Identifier =>

                Bounded_String.Copy (N.Mess, Lex.Get_Value);
                Lex.Next_Token;
                if not Failed and Lex.Token'Pos (Lex.Get_Token) =
                                     Lex.Token'Pos (Lex.Identifier) then
                    N.Rule := 1;
                    More_Unary.Parse (N.More, Failed);
                end if;
            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;
    function Is_First (T : Lex.Token) return Boolean is
        use Lex;
    begin
        return T = Lex.Identifier;
    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 := Object.Send (Inherited, N.Mess);
            when 1 =>
                Result := Object.Send (Inherited, N.Mess);
                Result := More_Unary.Interpret (N.More, Result);
        end case;
        return Result;

    end Interpret;
end More_Unary;