DataMuseum.dk

top - download

    Length: 1751 (0x6d7)
    Types: TextFile
    Names: »B«

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

TextFile

with Statements;
with Class_Printer;
with Bug_Report;

package body More_Statements is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Stat : Statements.Node := Statements.Empty_Node;
            Line : Object.Index := Scanner.Get_Line_Number;
        end record;

    procedure Parse (N : in out Node) is
        use Scanner;
    begin  
        N := new Node_Structure;
        case Scanner.Get_Token is
            when Scanner.Point =>
                N.Rule := 1;
                Scanner.Next;
                Statements.Parse (N.Stat);
            when Scanner.Eof | Scanner.Close_Brace =>
                N.Rule := 0;  
            when others =>
                raise Bug_Report.Point_Is_Missing;

        end case;
    end Parse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Point or else Statements.Is_First (T);
    end Is_First;

    procedure Unparse (N : Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Class_Printer.Put (".");
                Class_Printer.New_Line;
                Statements.Unparse (N.Stat);
        end case;  
    end Unparse;

    function Interpret (N : Node;
                        Inherited : Object.Reference := Object.Void_Reference)
                       return Object.Reference is
        Result : Object.Reference;
    begin
        Scanner.Put_Line_Number (N.Line);
        case N.Rule is
            when 0 =>
                Result := Inherited;
            when 1 =>
                Result := Statements.Interpret (N.Stat);
        end case;
        return Result;
    end Interpret;
end More_Statements;