1 /* @(#)parser1.c 8.1 (Berkeley) 6/6/93 */
2 /* $NetBSD: parser1.c,v 1.6 2003/08/07 11:17:28 agc Exp $ */
5 * Copyright (c) 1983, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * Edward Wang at The University of California, Berkeley.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46 p_statementlist(flag);
47 if (token == T_EOF || p_abort())
51 while (token != T_EOL && token != T_EOF) {
63 p_statementlist(char flag)
65 for (; p_statement(flag) >= 0; p_clearerr())
70 p_statement(char flag)
79 return p_expression(flag);
92 if (p_expr(&t, flag) < 0) {
98 true = !true && t.v_num != 0;
101 p_error("if: Numeric value required.");
108 if (token != T_THEN) {
114 p_statementlist(flag && true);
118 if (token == T_ELSIF)
121 if (token == T_ELSE) {
123 p_statementlist(flag && !true);
128 if (token == T_ENDIF) {
138 p_expression(char flag)
155 if (p_expr(&t, flag) < 0)
157 if (token == T_EOF) {
162 if (token != T_ASSIGN && p_convstr(&t) < 0)
164 cmd = t.v_type == V_STR ? t.v_str : 0;
165 if ((*(token == T_ASSIGN ? p_assign : p_function))(cmd, &t, flag) < 0) {
175 else if (token != T_EOF) {
183 p_convstr(struct value *v)
185 if (v->v_type != V_NUM)
187 if ((v->v_str = str_itoa(v->v_num)) == 0) {
199 if (!cx.x_synerred) {
200 cx.x_synerred = cx.x_erred = 1;
201 error("Syntax error.");
206 p_error(const char *msg, ...)
221 cx.x_erred = cx.x_abort = 1;
222 error("Out of memory.");