DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about Rational R1000/400 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - metrics - download
Index: B T

⟦26188cb85⟧ TextFile

    Length: 2279 (0x8e7)
    Types: TextFile
    Names: »B«

Derivation

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─⟦d65440be7⟧ »DATA« 
        └─⟦this⟧

TextFile

with Abstract_Tree;  
with Lex2;
with Text_Io;
with Token;
use Token;
procedure Test_Abstract_Tree is
    Premier_Noeud, Second_Noeud, Troisieme_Noeud, Une_Feuille, Deux_Feuille :
       Abstract_Tree.P_Node;
    La_Liste : Abstract_Tree.P_Instruction_List;
begin
    Lex2.Open ("arbre_abstrait");
    Lex2.Next;
    Abstract_Tree.Create_List (La_Liste);
    Une_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Premier_Noeud := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Second_Noeud := Abstract_Tree.Make_Node (Une_Feuille, Premier_Noeud);
    Abstract_Tree.Add_The_List (La_Liste, Second_Noeud);
    Lex2.Next;
    Une_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Premier_Noeud := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Second_Noeud := Abstract_Tree.Make_Node (Une_Feuille, Premier_Noeud);
    Abstract_Tree.Add_The_List (La_Liste, Second_Noeud);
    Lex2.Next;
    Une_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Premier_Noeud := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Second_Noeud := Abstract_Tree.Make_Node (Une_Feuille, Premier_Noeud);
    Abstract_Tree.Add_The_List (La_Liste, Second_Noeud);
    Lex2.Next;
    Une_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Premier_Noeud := Abstract_Tree.Make_Foliage;
    Lex2.Next;  
    Text_Io.Put_Line (Lex2.Get_Value);
    Second_Noeud := Abstract_Tree.Make_Node (Une_Feuille, Premier_Noeud);
    Abstract_Tree.Add_The_List (La_Liste, Second_Noeud);

    Lex2.Next;
    Une_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Deux_Feuille := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Premier_Noeud := Abstract_Tree.Make_Foliage;
    Lex2.Next;
    Second_Noeud := Abstract_Tree.Make_Node
                       (Une_Feuille, Deux_Feuille, Premier_Noeud);
    Abstract_Tree.Add_The_List (La_Liste, Second_Noeud);


    Abstract_Tree.Node_Identification (La_Liste);
    Abstract_Tree.Next_List (La_Liste);
    Abstract_Tree.Node_Identification (La_Liste);
    Abstract_Tree.Next_List (La_Liste);
    Abstract_Tree.Node_Identification (La_Liste);
    Abstract_Tree.Next_List (La_Liste);
    Abstract_Tree.Node_Identification (La_Liste);
    Abstract_Tree.Next_List (La_Liste);
    Abstract_Tree.Node_Identification (La_Liste);


end Test_Abstract_Tree;