|
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: 1822 (0x71e)
Types: TextFile
Names: »B«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─ ⟦129cab021⟧ »DATA«
└─⟦this⟧
with Scanner;
with Object;
with Expression, More_Statements;
package body Statements is
type Node_Structure is
record
Rule : Natural range 0 .. 2 := 0;
Expr : Expression.Node := Expression.Empty_Node;
More : More_Statements.Node := More_Statements.Empty_Node;
end record;
procedure Parse (N : in out Node; Error : out Boolean) is
Failed : Boolean := False;
begin
N := new Node_Structure;
if Expression.Is_First (Scanner.Get_Token) then
N.Rule := 1;
Expression.Parse (N.Expr, Failed);
if not Failed then
More_Statements.Parse (N.More, Failed);
end if;
else
case Scanner.Get_Token is
when Scanner.Renvoyer =>
N.Rule := 2;
Scanner.Next;
Expression.Parse (N.Expr, Failed);
when others =>
null;
end case;
end if;
Error := Failed;
end Parse;
function Is_First (T : Scanner.Token) return Boolean is
use Scanner;
begin
return T = Renvoyer or else Expression.Is_First (T);
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 := Expression.Interpret (N.Expr);
Result := More_Statements.Interpret (N.More, Result);
when 2 =>
Result := Expression.Interpret (N.Expr);
end case;
return Result;
end Interpret;
end Statements;