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: 2463 (0x99f) Types: TextFile Names: »B«
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04 └─ ⟦d65440be7⟧ »DATA« └─⟦this⟧
with Arguments, Statements, Scanner, Object, Message, Text_Io, Table, Tiny_Error; package body Bloc is type Node_Structure is record Arg : Arguments.Node := Arguments.Empty_Node; Sta : Statements.Node := Statements.Empty_Node; Id_List : Message.List; Keyword_List : Message.List; Symbol : Table.Symbol_Kind; Parent_Bloc : Node := Empty_Node; end record; Current_Node : Node; function Current return Node is begin return Current_Node; end Current; function Symbol (N : Node) return Table.Symbol_Kind is begin return N.Symbol; end Symbol; function Parent (N : Node) return Node is begin return N.Parent_Bloc; end Parent; function Keyword_List (N : Node) return Message.List is begin return N.Keyword_List; end Keyword_List; function Identifier_List (N : Node) return Message.List is begin return N.Id_List; end Identifier_List; procedure Parse (N : in out Node; Error : out Boolean) is Failed : Boolean := False; use Scanner; begin Text_Io.Put_Line ("i am in bloc.parse"); N := new Node_Structure; N.Parent_Bloc := Current_Node; Current_Node := N; Message.Init (N.Keyword_List); Message.Init (N.Id_List); Table.Initialize (N.Symbol); Scanner.Next; Arguments.Parse (N.Arg, N.Keyword_List, N.Id_List, N.Symbol, Failed); if not Failed then Statements.Parse (N.Sta, Failed); if not Failed and Scanner.Get_Token /= Scanner.T_Bloc_End then Failed := True; Tiny_Error.Miss_Ending_Accolade; end if; end if; if N.Parent_Bloc /= Empty_Node then Current_Node := N.Parent_Bloc; end if; Error := Failed; end Parse; function Interpret (N : Node) return Object.Reference is Result : Object.Reference; begin Current_Node := N; Result := Statements.Interpret (N.Sta, Result); if N.Parent_Bloc /= Empty_Node then Current_Node := N.Parent_Bloc; end if; return (Result); end Interpret; begin Current_Node := new Node_Structure; Message.Init (Current_Node.Keyword_List); Message.Init (Current_Node.Id_List); Table.Initialize (Current_Node.Symbol); end Bloc;