Subversion Repositories tendra.SVN

Rev

Rev 5 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1
/*
6 7u83 2
 * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions are met:
7
 *
8
 * 1. Redistributions of source code must retain the above copyright notice,
9
 *    this list of conditions and the following disclaimer.
10
 * 2. Redistributions in binary form must reproduce the above copyright notice,
11
 *    this list of conditions and the following disclaimer in the documentation
12
 *    and/or other materials provided with the distribution.
13
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
14
 *    may be used to endorse or promote products derived from this software
15
 *    without specific, prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
18
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
19
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
21
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
 *
29
 * $Id$
30
 */
31
/*
2 7u83 32
    		 Crown Copyright (c) 1997
6 7u83 33
 
2 7u83 34
    This TenDRA(r) Computer Program is subject to Copyright
35
    owned by the United Kingdom Secretary of State for Defence
36
    acting through the Defence Evaluation and Research Agency
37
    (DERA).  It is made available to Recipients with a
38
    royalty-free licence for its use, reproduction, transfer
39
    to other parties and amendment for any purpose not excluding
40
    product development provided that any such use et cetera
41
    shall be deemed to be acceptance of the following conditions:-
6 7u83 42
 
2 7u83 43
        (1) Its Recipients shall ensure that this Notice is
44
        reproduced upon any copies or amended versions of it;
6 7u83 45
 
2 7u83 46
        (2) Any amended version of it shall be clearly marked to
47
        show both the nature of and the organisation responsible
48
        for the relevant amendment or amendments;
6 7u83 49
 
2 7u83 50
        (3) Its onward transfer from a recipient to another
51
        party shall be deemed to be that party's acceptance of
52
        these conditions;
6 7u83 53
 
2 7u83 54
        (4) DERA gives no warranty or assurance as to its
55
        quality or suitability for any purpose and DERA accepts
56
        no liability whatsoever in relation to any use to which
57
        it may be put.
58
*/
59
 
60
 
61
#ifndef CHAR_INCLUDED
62
#define CHAR_INCLUDED
63
 
64
 
65
/*
66
    TYPE REPRESENTING A CHARACTER
67
 
68
    A character consists of a single letter (which may have associated
69
    data) plus pointers to the next character and to a list of alternative
70
    characters.
71
*/
72
 
6 7u83 73
typedef unsigned int letter;
2 7u83 74
 
75
typedef struct character_tag {
6 7u83 76
    letter ch;
77
    char *defn;
78
    char *args;
79
    char *cond;
80
    struct character_tag *opt;
81
    struct character_tag *next;
82
} character;
2 7u83 83
 
84
 
85
/*
86
    TYPE REPRESENTING A CHARACTER GROUP
87
 
88
    A character group is a named array of letters.
89
*/
90
 
91
typedef struct {
6 7u83 92
    char *name;
93
    letter *defn;
94
} char_group;
2 7u83 95
 
96
 
97
/*
98
    TYPE REPRESENTING A KEYWORD
99
 
100
    A keyword consists of a name plus some associated data.  All keywords
101
    are formed into a list using the next field.  done is a flag used in
102
    the output routines.
103
*/
104
 
105
typedef struct keyword_tag {
6 7u83 106
    char *name;
107
    char *defn;
108
    char *args;
109
    char *cond;
110
    int done;
111
    struct keyword_tag *next;
112
} keyword;
2 7u83 113
 
114
 
115
/*
116
    PARAMETERS
117
*/
118
 
119
#define MAX_GROUPS		15
120
 
121
 
122
/*
123
    SPECIAL LETTERS
124
*/
125
 
6 7u83 126
#define SIMPLE_LETTER		((letter)0x0100)
127
#define EOF_LETTER		((letter)0x0100)
128
#define LAST_LETTER		((letter)0x0101)
129
#define WHITE_LETTER		((letter)0x0102)
130
#define GROUP_LETTER		((letter)0x0103)
2 7u83 131
 
132
 
133
/*
134
    DECLARATIONS FOR CHARACTER ROUTINES
135
*/
136
 
6 7u83 137
extern letter *white_space;
138
extern character *pre_pass;
139
extern character *main_pass;
140
extern char_group groups [];
141
extern int no_groups;
142
extern keyword *keywords;
143
extern void add_char(character *, letter *, char **);
144
extern void make_group(char *, letter *);
145
extern int in_group(letter *, letter);
146
extern letter *make_string(char *);
147
extern letter find_escape(int);
148
extern void add_keyword(char *, char **);
2 7u83 149
 
150
 
151
#endif