DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 Tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - downloadIndex: ┃ B T ┃
Length: 1828 (0x724) Types: TextFile Names: »B«
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04 └─ ⟦d65440be7⟧ »DATA« └─⟦this⟧
with Object, Unary, Message, Argument, Scanner, Text_Io; package body More_Binary is type Node_Structure is record Rule : Natural range 0 .. 1 := 0; Unar : Unary.Node := Unary.Empty_Node; More : More_Binary.Node := Empty_Node; Mess : Message.Selector; end record; procedure Parse (N : in out Node; Error : out Boolean) is Failed : Boolean := False; use Scanner; begin Text_Io.Put_Line ("I am in more_binary.parse"); N := new Node_Structure; N.Mess := Scanner.Get_Value; Scanner.Next; Unary.Parse (N.Unar, Failed); if not Failed and Is_First (Scanner.Get_Token) then N.Rule := 1; Parse (N.More, Failed); end if; Error := Failed; end Parse; function Is_First (T : Scanner.Token) return Boolean is use Scanner; begin return T = T_Binary_Message; end Is_First; function Interpret (N : Node; Inherited : Object.Reference) return Object.Reference is Result : Object.Reference; Args : Argument.List; begin Text_Io.Put_Line ("I am in more_binary.interpret"); Argument.Init (L => Args); case N.Rule is when 0 => Result := Unary.Interpret (N.Unar); Args := Argument.Put (L => Args, Obj => Result); Result := Message.Send (Inherited, N.Mess, Args); when 1 => Result := Unary.Interpret (N.Unar); Args := Argument.Put (L => Args, Obj => Result); Result := Message.Send (Inherited, N.Mess, Args); Result := Interpret (N.More, Result); end case; return (Result); end Interpret; end More_Binary;