1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/***************************************
$Header: /cvs/src/jbofihe/functions.h,v 1.13 2001/06/22 22:17:14 richard Exp $
Prototypes for functions
***************************************/
/**********************************************************************
* Copyright (C) Richard P. Curnow 1998-2001
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
*********************************************************************/
#ifndef FUNCTIONS_H
#define FUNCTIONS_H /*+ To stop multiple inclusions. +*/
#include <stdio.h>
#include <stdlib.h>
#include "nonterm.h"
#include "nodes.h"
#include "output.h"
#define new_string(s) strcpy((char *) Malloc(1+strlen(s)), (s))
#define extend_string(x,s) (strcat(Realloc(x, (strlen(x)+strlen(s)+1)), s))
#define new(T) (T *) Malloc(sizeof(T))
#define new_array(T, n) (T *) Malloc(sizeof(T) * (n))
#define grow_array(T, n, oldX) (T *) ((oldX) ? Realloc(oldX, (sizeof(T) * (n))) : Malloc(sizeof(T) * (n)))
/* In functions.c */
TreeNode *new_node(void);
TreeNode *new_elidable(int code, int selmao);
TreeNode *
new_node_0(NonTerm nt);
TreeNode *
new_node_1(NonTerm nt, TreeNode *c1);
TreeNode *
new_node_2(NonTerm nt, TreeNode *c1, TreeNode *c2);
TreeNode *
new_node_3(NonTerm nt, TreeNode *c1, TreeNode *c2, TreeNode *c3);
TreeNode *
new_node_4(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4);
TreeNode *
new_node_5(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5);
TreeNode *
new_node_6(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6);
TreeNode *
new_node_7(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7);
TreeNode *
new_node_8(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7, TreeNode *c8);
TreeNode *
new_node_9(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7, TreeNode *c8,
TreeNode *c9);
TreeNode *
new_node_10(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7, TreeNode *c8,
TreeNode *c9, TreeNode *c10);
TreeNode *
new_node_11(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7, TreeNode *c8,
TreeNode *c9, TreeNode *c10, TreeNode *c11);
TreeNode *
new_node_12(NonTerm nt,
TreeNode *c1, TreeNode *c2, TreeNode *c3, TreeNode *c4,
TreeNode *c5, TreeNode *c6, TreeNode *c7, TreeNode *c8,
TreeNode *c9, TreeNode *c10, TreeNode *c11, TreeNode *c12);
extern void type_check(TreeNode *x, NonTerm type);
extern TreeNode * child_ref(TreeNode *x, int i);
extern int nch(TreeNode *x);
extern TreeNode *find_nth_child(TreeNode *x, int n, NonTerm type);
extern TreeNode *find_nth_cmavo_child(TreeNode *x, int n, int selmao);
extern TreeNode *strip_attitudinal(TreeNode *x);
extern TreeNode *maybe_strip_attitudinal(TreeNode *x);
extern int is_simple_nonterm(TreeNode *x);
extern char *make_uppercase(char *s);
/* In categ.c */
void categorize_tokens(TreeNode *head);
/* In lex2.c */
void lex2_initialise(void);
void add_token(TreeNode *tok);
void mark_eol(void);
void delete_node(TreeNode *x);
void free_node(TreeNode *x);
void show_tokens(void);
void preprocess_tokens(void);
void error_advance(int code);
int yylex(void);
void print_last_toks(void);
/* Return dynamically allocated string */
char *build_string_from_nodes(TreeNode *start, TreeNode *end);
char *build_string_from_node(TreeNode *the_node);
/* In erasure.c */
void do_erasures(TreeNode *toks);
/* In lex1.c */
void parse_file(FILE *f);
/* In tree.c */
void compress_singletons(TreeNode *x);
void print_parse_tree(TreeNode *x);
void print_bracketed_text(TreeNode *top, int gloss);
void expand_bahe_ui(TreeNode *top);
/* In translate.c */
char * translate(char *word);
typedef enum {
TCX_NOUN = 0,
TCX_VERB = 1,
TCX_QUAL = 2,
TCX_TAG = 3
} TransContext;
char *translate_unknown(char *w, int place, TransContext ctx);
char *adv_translate(char *w, int place, TransContext ctx);
/* In output.c */
extern void add_bracketing_tags(TreeNode *top);
extern void do_output(TreeNode *top, DriverVector *driver);
/* In properties.c */
#define YES 1
#define NO 0
extern XConversion *prop_conversion(TreeNode *x, int create);
extern XBaiConversion *prop_bai_conversion(TreeNode *x, int create);
extern XDontGloss *prop_dont_gloss(TreeNode *x, int create);
extern XTermVectors *prop_term_vectors(TreeNode *x, int create);
extern XTermVector *prop_term_vector(TreeNode *x, int create);
extern XTermTags *prop_term_tags(TreeNode *x, int create);
extern XGlosstype *prop_glosstype(TreeNode *x, int create);
extern XDoneTU1 *prop_done_tu1(TreeNode *x, int create);
extern XDoneS3 *prop_done_s3(TreeNode *x, int create);
extern XTenseCtx *prop_tense_ctx(TreeNode *x, int create);
extern XNegIndicator *prop_neg_indicator(TreeNode *x, int create);
extern XCaiIndicator *prop_cai_indicator(TreeNode *x, int create);
extern XConnective *prop_connective(TreeNode *x, int create);
extern XAntecedent *prop_antecedent(TreeNode *x, int create);
extern XRequireBrac *prop_require_brac(TreeNode *x, int create);
extern XRelClauseLink *prop_rel_clause_link(TreeNode *x, int create);
extern XContainsKeha *prop_contains_keha(TreeNode *x, int create);
extern XElidable *prop_elidable(TreeNode *x, int create);
/* In conversion.c */
extern void do_conversions(TreeNode *top);
/* In terms.c */
extern void terms_processing(TreeNode *top);
/* In memory.c */
extern void *Malloc(size_t n);
extern void *Realloc(void *old, size_t n);
extern void Free(void *x);
extern void print_memory_statistics(void);
/* In tenses.c */
extern void tense_processing(TreeNode *top);
/* In connect.c */
extern void connectives_processing(TreeNode *top);
/* In relative.c */
extern void relative_clause_processing (TreeNode *top);
/* In errorscan.c */
extern void error_scan (TreeNode *x);
#endif /* FUNCTIONS_H */
|
