2 * Copyright (c) 1985 Sun Microsystems, Inc.
3 * Copyright (c) 1980, 1993
4 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. 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
35 * @(#)parse.c 8.1 (Berkeley) 6/6/93
36 * $FreeBSD: src/usr.bin/indent/parse.c,v 1.10 2003/06/15 09:28:17 charnier Exp $
37 * $DragonFly: src/usr.bin/indent/parse.c,v 1.3 2005/04/10 20:55:38 drhodus Exp $
41 #include "indent_globs.h"
42 #include "indent_codes.h"
45 static void reduce(void);
48 parse(int tk) /* tk: the code for the construct scanned */
53 printf("%2d - %s\n", tk, token);
56 while (ps.p_stack[ps.tos] == ifhead && tk != elselit) {
57 /* true if we have an if without an else */
58 ps.p_stack[ps.tos] = stmt; /* apply the if(..) stmt ::= stmt
60 reduce(); /* see if this allows any reduction */
64 switch (tk) { /* go on and figure out what to do with the
67 case decl: /* scanned a declaration word */
68 ps.search_brace = btype_2;
69 /* indicate that following brace should be on same line */
70 if (ps.p_stack[ps.tos] != decl) { /* only put one declaration
72 break_comma = true; /* while in declaration, newline should be
73 * forced after comma */
74 ps.p_stack[++ps.tos] = decl;
75 ps.il[ps.tos] = ps.i_l_follow;
77 if (ps.ljust_decl) {/* only do if we want left justified
80 for (i = ps.tos - 1; i > 0; --i)
81 if (ps.p_stack[i] == decl)
82 ++ps.ind_level; /* indentation is number of
83 * declaration levels deep we are */
84 ps.i_l_follow = ps.ind_level;
89 case ifstmt: /* scanned if (...) */
90 if (ps.p_stack[ps.tos] == elsehead && ps.else_if) /* "else if ..." */
91 ps.i_l_follow = ps.il[ps.tos];
92 case dolit: /* 'do' */
93 case forstmt: /* for (...) */
94 ps.p_stack[++ps.tos] = tk;
95 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow;
96 ++ps.i_l_follow; /* subsequent statements should be indented 1 */
97 ps.search_brace = btype_2;
100 case lbrace: /* scanned { */
101 break_comma = false; /* don't break comma in an initial list */
102 if (ps.p_stack[ps.tos] == stmt || ps.p_stack[ps.tos] == decl
103 || ps.p_stack[ps.tos] == stmtl)
104 ++ps.i_l_follow; /* it is a random, isolated stmt group or a
107 if (s_code == e_code) {
109 * only do this if there is nothing on the line
113 * it is a group as part of a while, for, etc.
115 if (ps.p_stack[ps.tos] == swstmt && ps.case_indent >= 1)
118 * for a switch, brace should be two levels out from the code
123 ps.p_stack[++ps.tos] = lbrace;
124 ps.il[ps.tos] = ps.ind_level;
125 ps.p_stack[++ps.tos] = stmt;
126 /* allow null stmt between braces */
127 ps.il[ps.tos] = ps.i_l_follow;
130 case whilestmt: /* scanned while (...) */
131 if (ps.p_stack[ps.tos] == dohead) {
132 /* it is matched with do stmt */
133 ps.ind_level = ps.i_l_follow = ps.il[ps.tos];
134 ps.p_stack[++ps.tos] = whilestmt;
135 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow;
137 else { /* it is a while loop */
138 ps.p_stack[++ps.tos] = whilestmt;
139 ps.il[ps.tos] = ps.i_l_follow;
141 ps.search_brace = btype_2;
146 case elselit: /* scanned an else */
148 if (ps.p_stack[ps.tos] != ifhead)
149 diag2(1, "Unmatched 'else'");
151 ps.ind_level = ps.il[ps.tos]; /* indentation for else should
152 * be same as for if */
153 ps.i_l_follow = ps.ind_level + 1; /* everything following should
155 ps.p_stack[ps.tos] = elsehead;
156 /* remember if with else */
157 ps.search_brace = btype_2 | ps.else_if;
161 case rbrace: /* scanned a } */
162 /* stack should have <lbrace> <stmt> or <lbrace> <stmtl> */
163 if (ps.p_stack[ps.tos - 1] == lbrace) {
164 ps.ind_level = ps.i_l_follow = ps.il[--ps.tos];
165 ps.p_stack[ps.tos] = stmt;
168 diag2(1, "Statement nesting error");
171 case swstmt: /* had switch (...) */
172 ps.p_stack[++ps.tos] = swstmt;
173 ps.cstk[ps.tos] = case_ind;
174 /* save current case indent level */
175 ps.il[ps.tos] = ps.i_l_follow;
176 case_ind = ps.i_l_follow + ps.case_indent; /* cases should be one
179 ps.i_l_follow += ps.case_indent + 1; /* statements should be two
181 ps.search_brace = btype_2;
184 case semicolon: /* this indicates a simple stmt */
185 break_comma = false; /* turn off flag to break after commas in a
187 ps.p_stack[++ps.tos] = stmt;
188 ps.il[ps.tos] = ps.ind_level;
191 default: /* this is an error */
192 diag2(1, "Unknown code to parser");
196 } /* end of switch */
198 reduce(); /* see if any reduction can be done */
201 for (i = 1; i <= ps.tos; ++i)
202 printf("(%d %d)", ps.p_stack[i], ps.il[i]);
212 * FUNCTION: Implements the reduce part of the parsing algorithm
214 * ALGORITHM: The following reductions are done. Reductions are repeated
215 * until no more are possible.
218 * <stmt> <stmt> <stmtl>
219 * <stmtl> <stmt> <stmtl>
222 * switch <stmt> <stmt>
224 * "ifelse" <stmt> <stmt>
226 * while <stmt> <stmt>
227 * "dostmt" while <stmt>
229 * On each reduction, ps.i_l_follow (the indentation for the following line)
230 * is set to the indentation level associated with the old TOS.
236 * GLOBALS: ps.cstk ps.i_l_follow = ps.il ps.p_stack = ps.tos =
242 * HISTORY: initial coding November 1976 D A Willcox of CAC
245 /*----------------------------------------------*\
247 \*----------------------------------------------*/
253 for (;;) { /* keep looping until there is nothing left to
256 switch (ps.p_stack[ps.tos]) {
259 switch (ps.p_stack[ps.tos - 1]) {
263 /* stmtl stmt or stmt stmt */
264 ps.p_stack[--ps.tos] = stmtl;
267 case dolit: /* <do> <stmt> */
268 ps.p_stack[--ps.tos] = dohead;
269 ps.i_l_follow = ps.il[ps.tos];
274 ps.p_stack[--ps.tos] = ifhead;
277 ps.p_stack[i] != stmt
279 ps.p_stack[i] != stmtl
281 ps.p_stack[i] != lbrace
284 ps.i_l_follow = ps.il[i];
286 * for the time being, we will assume that there is no else on
287 * this if, and set the indentation level accordingly. If an
288 * else is scanned, it will be fixed up later
293 /* <switch> <stmt> */
294 case_ind = ps.cstk[ps.tos - 1];
296 case decl: /* finish of a declaration */
298 /* <<if> <stmt> else> <stmt> */
303 ps.p_stack[--ps.tos] = stmt;
304 ps.i_l_follow = ps.il[ps.tos];
307 default: /* <anything else> <stmt> */
310 } /* end of section for <stmt> on top of stack */
313 case whilestmt: /* while (...) on top */
314 if (ps.p_stack[ps.tos - 1] == dohead) {
315 /* it is termination of a do while */
322 default: /* anything else on top */