* Makefile.in (SFILES_MAINDIR): Add ch-exp.y.
[deliverable/binutils-gdb.git] / gdb / parser-defs.h
1 /* Parser definitions for GDB.
2 Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc.
3 Modified from expread.y by the Department of Computer Science at the
4 State University of New York at Buffalo.
5
6 This file is part of GDB.
7
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
12
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
17
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
21
22 #if !defined (PARSER_DEFS_H)
23 #define PARSER_DEFS_H 1
24
25 struct std_regs {
26 char *name;
27 int regnum;
28 };
29
30 extern struct std_regs std_regs[];
31 extern unsigned num_std_regs;
32
33 struct expression *expout;
34 int expout_size;
35 int expout_ptr;
36
37 /* If this is nonzero, this block is used as the lexical context
38 for symbol names. */
39
40 struct block *expression_context_block;
41
42 /* The innermost context required by the stack and register variables
43 we've encountered so far. */
44 struct block *innermost_block;
45
46 /* The block in which the most recently discovered symbol was found. */
47 struct block *block_found;
48
49 /* Number of arguments seen so far in innermost function call. */
50 int arglist_len;
51
52 /* Data structure for saving values of arglist_len
53 for function calls whose arguments contain other function calls. */
54
55 struct funcall
56 {
57 struct funcall *next;
58 int arglist_len;
59 };
60
61 struct funcall *funcall_chain;
62
63 /* This kind of datum is used to represent the name
64 of a symbol token. */
65
66 struct stoken
67 {
68 char *ptr;
69 int length;
70 };
71
72 struct ttype
73 {
74 struct stoken stoken;
75 struct type *type;
76 };
77
78 struct symtoken
79 {
80 struct stoken stoken;
81 struct symbol *sym;
82 int is_a_field_of_this;
83 };
84
85 /* For parsing of complicated types.
86 An array should be preceded in the list by the size of the array. */
87 enum type_pieces
88 {tp_end = -1, tp_pointer, tp_reference, tp_array, tp_function};
89 /* The stack can contain either an enum type_pieces or an int. */
90 union type_stack_elt {
91 enum type_pieces piece;
92 int int_val;
93 };
94 union type_stack_elt *type_stack;
95 int type_stack_depth, type_stack_size;
96
97 extern void
98 write_exp_elt PARAMS ((union exp_element));
99
100 extern void
101 write_exp_elt_opcode PARAMS ((enum exp_opcode));
102
103 extern void
104 write_exp_elt_sym PARAMS ((struct symbol *));
105
106 extern void
107 write_exp_elt_longcst PARAMS ((LONGEST));
108
109 extern void
110 write_exp_elt_dblcst PARAMS ((double));
111
112 extern void
113 write_exp_elt_type PARAMS ((struct type *));
114
115 extern void
116 write_exp_elt_intern PARAMS ((struct internalvar *));
117
118 extern void
119 write_exp_string PARAMS ((struct stoken));
120
121 extern void
122 start_arglist PARAMS ((void));
123
124 extern int
125 end_arglist PARAMS ((void));
126
127 extern void
128 free_funcalls PARAMS ((void));
129
130 extern char *
131 copy_name PARAMS ((struct stoken));
132
133 extern void
134 push_type PARAMS ((enum type_pieces));
135
136 extern void
137 push_type_int PARAMS ((int));
138
139 extern enum type_pieces
140 pop_type PARAMS ((void));
141
142 extern int
143 pop_type_int PARAMS ((void));
144
145 /* During parsing of a C expression, the pointer to the next character
146 is in this variable. */
147
148 char *lexptr;
149
150 /* Tokens that refer to names do so with explicit pointer and length,
151 so they can share the storage that lexptr is parsing.
152
153 When it is necessary to pass a name to a function that expects
154 a null-terminated string, the substring is copied out
155 into a block of storage that namecopy points to.
156
157 namecopy is allocated once, guaranteed big enough, for each parsing. */
158
159 char *namecopy;
160
161 /* Current depth in parentheses within the expression. */
162
163 int paren_depth;
164
165 /* Nonzero means stop parsing on first comma (if not within parentheses). */
166
167 int comma_terminates;
168 \f
169 /* These codes indicate operator precedences for expression printing,
170 least tightly binding first. */
171 /* Adding 1 to a precedence value is done for binary operators,
172 on the operand which is more tightly bound, so that operators
173 of equal precedence within that operand will get parentheses. */
174 /* PREC_HYPER and PREC_ABOVE_COMMA are not the precedence of any operator;
175 they are used as the "surrounding precedence" to force
176 various kinds of things to be parenthesized. */
177 enum precedence
178 { PREC_NULL, PREC_COMMA, PREC_ABOVE_COMMA, PREC_ASSIGN, PREC_LOGICAL_OR,
179 PREC_LOGICAL_AND, PREC_BITWISE_IOR, PREC_BITWISE_AND, PREC_BITWISE_XOR,
180 PREC_EQUAL, PREC_ORDER, PREC_SHIFT, PREC_ADD, PREC_MUL, PREC_REPEAT,
181 PREC_HYPER, PREC_PREFIX, PREC_SUFFIX };
182
183 /* Table mapping opcodes into strings for printing operators
184 and precedences of the operators. */
185
186 struct op_print
187 {
188 char *string;
189 enum exp_opcode opcode;
190 /* Precedence of operator. These values are used only by comparisons. */
191 enum precedence precedence;
192 int right_assoc;
193 };
194
195 #endif /* PARSER_DEFS_H */
This page took 0.038084 seconds and 5 git commands to generate.