|
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: 1872 (0x750)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─ ⟦129cab021⟧ »DATA«
└─⟦this⟧
with Lex;
with Object;
with More1_List;
with More2_List;
package body List is
type Node_Structure is
record
Rule : Natural range 0 .. 1 := 0;
More1 : More1_List.Node := More1_List.Empty_Node;
More2 : More2_List.Node := More2_List.Empty_Node;
end record;
procedure Parse (N : in out Node; Error : out Boolean) is
Failed : Boolean := False;
begin
N := new Node_Structure;
if Lex.Token'Pos (Lex.Get_Token) = Lex.Token'Pos (Lex.Identifier) then
N.Rule := 0;
More1_List.Parse (N.More1, Failed);
else
if Lex.Token'Pos (Lex.Get_Token) = Lex.Token'Pos (Lex.Key_Word) then
N.Rule := 1;
More2_List.Parse (N.More2, Failed);
end if;
end if;
Error := Failed;
end Parse;
function Is_First (T : Lex.Token) return Boolean is
use Lex;
begin
return T = Lex.Identifier or else T = Lex.Key_Word;
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;
Result := More1_List.Interpret (N.More1, Result);
when 1 =>
Result := Inherited;
Result := More2_List.Interpret (N.More2, Result);
end case;
return Result;
end Interpret;
procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is
begin
case N.Rule is
when 0 =>
More1_List.Set (N.More1, The_Argument);
when 1 =>
More2_List.Set (N.More2, The_Argument);
end case;
end Set;
end List;