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: 1997 (0x7cd) Types: TextFile Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11 └─ ⟦129cab021⟧ »DATA« └─⟦this⟧
with Text_Io; with Lex; with Object; with List; with Error_Broadcaster; package body Arguments is type Node_Structure is record Rule : Natural range 0 .. 1 := 0; Lst : List.Node := List.Empty_Node; end record; procedure Parse (N : in out Node; Error : out Boolean) is Failed : Boolean := False; begin N := new Node_Structure; case Lex.Get_Token is when Lex.Avec => N.Rule := 1; Lex.Next_Token; List.Parse (N.Lst, Failed); if not Failed then if Lex.Token'Pos (Lex.Get_Token) = Lex.Token'Pos (Lex.Dot) then Lex.Next_Token; else raise Error_Broadcaster.Dot_Is_Missing; end if; end if; when others => null; end case; Error := Failed; end Parse; procedure Unparse (N : in out Node) is begin case N.Rule is when 0 => null; when 1 => Text_Io.Put ("avec"); List.Unparse (N.Lst); Text_Io.Put_Line ("."); end case; end Unparse; function Is_First (T : Lex.Token) return Boolean is use Lex; begin return T = Lex.Dot; 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 := List.Interpret (N.Lst); end case; return Result; end Interpret; procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is begin List.Set (N.Lst, The_Argument); end Set; end Arguments;