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 - download
Index: ┃ B T

⟦eea3fca95⟧ TextFile

    Length: 2009 (0x7d9)
    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

separate (Lexical.Simulated_Automate)

package body Keywords is

    type P_Keyword is access String;
    subtype Keyword_Token is Token range L_Activer .. L_Temporel;
    type Keywords is array (Keyword_Token) of P_Keyword;

    All_Keywords : constant Keywords :=
       (new String'("ACTIVER"), new String'("ALORS"), new String'("AUTEMPS"),
        new String'("ATTENDRE"), new String'("AVEC"), new String'("BINAIRE"),
        new String'("CATEGORIE"), new String'("DANS"), new String'("DEBUT"),
        new String'("DESACTIVER"), new String'("DISCRET"), new String'("EFFET"),
        new String'("ELEMENT"), new String'("EN"), new String'("ENSEQUENCE"),
        new String'("EST"), new String'("EVOLUER"), new String'("EXPERIENCE"),
        new String'("FAIRE"), new String'("FIN"), new String'("FOIS"),
        new String'("FUGITIF"), new String'("IMPLANTATION"),
        new String'("JUSQUA"), new String'("MATERIEL"), new String'("MOD"),
        new String'("MODIFIER"), new String'("PENDANT"),
        new String'("POURTOUS"), new String'("REPETER"),
        new String'("SCENE"), new String'("SI"), new String'("SINON"),
        new String'("SPECTACLE"), new String'("TEMPOREL"));


    function Is_Keyword (The_Lexeme : Lexeme) return Boolean is
        Word : constant String := String_Utilities.Upper_Case
                                     (Bounded_String.Image (The_Lexeme));
    begin
        for I in Keyword_Token loop
            if All_Keywords (I).all = Word then
                return True;
            end if;
        end loop;  
        return False;
    end Is_Keyword;

    function Lexeme_To_Token (From : Lexeme) return Token is
        Word : constant String := String_Utilities.Upper_Case
                                     (Bounded_String.Image (From));
    begin
        for I in Keyword_Token loop
            if All_Keywords (I).all = Word then
                return I;
            end if;
        end loop;
        return L_Id;
    end Lexeme_To_Token;

end Keywords;