DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about Rational R1000/400 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download
Index: ┃ B T

⟦79bc35510⟧ TextFile

    Length: 2003 (0x7d3)
    Types: TextFile
    Names: »B«

Derivation

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

TextFile

with Object;
with Scanner;

package body More_List_2 is

    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Keyw : Scanner.Lexeme := Scanner.Empty_Lexeme;
            Ident : Scanner.Lexeme := Scanner.Empty_Lexeme;
            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_Keyw =>
                N := new Node_Structure;
                N.Rule := 1;
                N.Keyw := Scanner.Get_Value;
                Scanner.Next_Token;
                case Scanner.Get_Token is
                    when Scanner.L_Id =>
                        N.Ident := Scanner.Get_Value;
                        Scanner.Next_Token;
                        if Is_First (Scanner.Get_Token) then
                            Parse (N.More, Failed);
                        else
                            Failed := True;
                        end if;  
                    when others =>
                        Failed := True;
                end case;
            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_Keyw;
    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_List_2;