|
|
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 - metrics - downloadIndex: T V
Length: 2420 (0x974)
Types: TextFile
Names: »V«
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
└─⟦129cab021⟧ »DATA«
└─⟦this⟧
with Token;
use Token;
package Abstract_Tree is
type P_Node is private;
type P_Instruction_List is private;
Negative_Value, Bad_Token, Unexist_Node : exception;
function Make_Node (A_Token : Token.Object; The_Left, The_Right : in P_Node)
return P_Node;
function Make_Node (A_Token : Token.Object;
The_Left : in P_Node;
The_Right : in P_Instruction_List) return P_Node;
function Make_Node
(A_Token : Token.Object; The_Time : in P_Node) return P_Node;
function Make_Node
(A_Token : Token.Object; The_List : in P_Instruction_List)
return P_Node;
function Make_Node (A_Token : Token.Object;
First_Term, The_Relation, Second_Term : in P_Node;
The_List : in P_Instruction_List) return P_Node;
function Make_Node
(A_Token : Token.Object;
The_Class, The_Actor, The_Value : in P_Node) return P_Node;
function Make_Node
(A_Token : Token.Object;
The_Class, The_Actor, Initial_Value, Final_Value : in P_Node)
return P_Node;
function Make_Node
(A_Token : Token.Object;
The_Time : P_Node;
First_List, Second_List : P_Instruction_List) return P_Node;
function Empty_Node return P_Node;
function Make_Foliage
(A_Token : Token.Object; A_Name : String) return P_Node;
function Make_Foliage
(A_Token : Token.Object; Value : Natural) return P_Node;
function Make_Foliage (A_Token : Token.Object) return P_Node;
procedure Execute_Code (The_Instruction_List : in out P_Instruction_List);
procedure Create_List (My_List : out P_Instruction_List);
procedure Add_The_List
(My_List : in out P_Instruction_List; A_Node : in P_Node);
private
type Kind_Node is (Empty, Plus, Moins, Mult, Div, Affect, Dans, Inf,
Sup, Egal, Pas_Egal, Inf_Ou_Egal, Sup_Ou_Egal,
Attendre, Tant_Que, Repeter, Debut, Activer, Desact,
Changer, Evoluer, Lancerscene, Lancereffet, Id, Nbr);
type Node (A_Kind_Node : Kind_Node);
type P_Node is access Node;
type Instruction_List;
type P_Instruction_List is access Instruction_List;
end Abstract_Tree;