DataMuseum.dk

top - download

    Length: 1813 (0x715)
    Types: TextFile
    Names: »B«

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

TextFile

with Object;
with Scanner;
with Unary;

package body More_Binary is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Binm : Scanner.Lexeme := Scanner.Empty_Lexeme;
            Unary : Unary.Node := Unary.Empty_Node;
            More : Node := Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;
    begin
        case Scanner.Get_Token is
            when Scanner.L_Binm =>
                N := new Node_Structure;
                N.Rule := 1;
                N.Binm := Scanner.Get_Value;
                Scanner.Next_Token;
                if Unary.Is_First (Scanner.Get_Token) then
                    Unary.Parse (N.Unary, Failed);
                    if not Failed then
                        Parse (N.More, Failed);
                    end if;  
                else
                    Failed := True;
                end if;
            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Scanner.L_Binm;
    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 := Inherited;
            when 1 =>
                Result := Expression.Interpret (N.Expr);
                Result := More_Statements.Interpret (N.More, Result);
            when 2 =>
                Result := Expression.Interpret (N.Expr);
        end case;
        return Result;
    end Interpret;

end More_Binary;