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

⟦5818471a9⟧ TextFile

    Length: 1926 (0x786)
    Types: TextFile
    Names: »B«

Derivation

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

TextFile

with Value, Scanner, Objects;
package body Expression is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;  
            Valu : Value.Node := Value.Empty_Node;  
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;
    begin
        N := new Node_Structure;  
        if Scanner.Symbol = Pour or else Value.Is_First (Scanner.Symbol) then
            if not Scanner.Symbol = Pour then
                N.Rule := 1;
                Value.Parse (N.Valu, Failed);
            else  
                Scanner.Next;
                if Scanner.Symbol = Identifier then  
                    Scanner.Next;
                    if Scanner.Symbol = Prendre then
                        Scanner.Next;
                        if Value.Is_First (Scanner.Symbol) then
                            Value.Parse (N.Valu, Failed);
                        else
                            Failed := True;  
                        end if;
                    else
                        Failed := True;
                    end if;  
                else
                    Failed := True;
                end if;
            end if;  
        else
            Failed := True;
        end if;  
        Error := Failed;
    end Parse;

    function Is_First (T : Scanner.Token) return Boolean is
        use Scanner;
    begin
        return T = Pour or else Is_First (Value);
    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 := Statements.Interpret (N.Stat);  
        end case;  
        return Result;
    end Interpret;
end Expression;