|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - download
Length: 3072 (0xc00) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_Binary, seg_032d1d
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000 └─ ⟦cfc2e13cd⟧ »Space Info Vol 2« └─⟦this⟧
with Scanner; with Object; with Unary; 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 := More_Binary.Empty_Node; Mess : Object.Binary := Object.Void_Binary; 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; Object.Put (Scanner.Get_Value, N.Mess); Scanner.Next; Unary.Parse (N.Unar, Failed); if not Failed and then Scanner.Get_Token = Scanner.Binary then N.Rule := 1; More_Binary.Parse (N.More, Failed); end if; Error := Failed; end Parse; function Is_First (T : Scanner.Token) return Boolean is use Scanner; begin return T = Scanner.Binary; end Is_First; function Interpret (N : Node; Inherited : Object.Reference := Object.Void_Reference) return Object.Reference is Result : Object.Reference; begin Result := Unary.Interpret (N.Unar); Object.Put (Result, N.Mess); Result := Object.Send (N.Mess, Inherited); if N.Rule = 1 then Result := More_Binary.Interpret (N.More, Result); end if; return Result; end Interpret; end More_Binary;
nblk1=2 nid=0 hdr6=4 [0x00] rec0=23 rec1=00 rec2=01 rec3=020 [0x01] rec0=11 rec1=00 rec2=02 rec3=001 tail 0x2172d9a8684c85ead9ada 0x42a00088462060003