DataMuseum.dk

top - download

    Length: 1185 (0x4a1)
    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 Primary, More_Unary;

package body Unary is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Prim : Primary.Node := Primary.Empty_Node;
            More : More_Unary.Node := More_Unary.Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;
        use Scanner;
    begin  
        N := new Node_Structure;
        N.Rule := 0;
        Primary.Parse (N.Prim, Failed);
        if not Failed and then Scanner.Get_Token = Scanner.Identifier then
            N.Rule := 1;
            More_Unary.Parse (N.More, Failed);
        end if;
        Error := Failed;
    end Parse;

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

    function Interpret (N : Node) return Object.Reference is
        Result : Object.Reference;
    begin
        Result := Primary.Interpret (N.Prim);
        if N.Rule = 1 then
            Result := More_Unary.Interpret (N.More, Result);
        end if;
        return Result;
    end Interpret;
end Unary;