Lines Matching refs:ps

64     while (ps.p_stack[ps.tos] == ifhead && tk != elselit) {  in parse()
66 ps.p_stack[ps.tos] = stmt; /* apply the if(..) stmt ::= stmt in parse()
76 ps.search_brace = opt.btype_2; in parse()
78 if (ps.p_stack[ps.tos] != decl) { /* only put one declaration in parse()
82 ps.p_stack[++ps.tos] = decl; in parse()
83 ps.il[ps.tos] = ps.i_l_follow; in parse()
87 ps.ind_level = 0; in parse()
88 for (i = ps.tos - 1; i > 0; --i) in parse()
89 if (ps.p_stack[i] == decl) in parse()
90 ++ps.ind_level; /* indentation is number of in parse()
92 ps.i_l_follow = ps.ind_level; in parse()
98 if (ps.p_stack[ps.tos] == elsehead && opt.else_if) /* "else if ..." */ in parse()
104 ps.i_l_follow = ps.il[ps.tos--]; in parse()
108 ps.p_stack[++ps.tos] = tk; in parse()
109 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow; in parse()
110 ++ps.i_l_follow; /* subsequent statements should be indented 1 */ in parse()
111 ps.search_brace = opt.btype_2; in parse()
116 if (ps.p_stack[ps.tos] == stmt || ps.p_stack[ps.tos] == decl in parse()
117 || ps.p_stack[ps.tos] == stmtl) in parse()
118 ++ps.i_l_follow; /* it is a random, isolated stmt group or a in parse()
125 --ps.ind_level; in parse()
129 if (ps.p_stack[ps.tos] == swstmt && opt.case_indent >= 1) in parse()
130 --ps.ind_level; in parse()
137 ps.p_stack[++ps.tos] = lbrace; in parse()
138 ps.il[ps.tos] = ps.ind_level; in parse()
139 ps.p_stack[++ps.tos] = stmt; in parse()
141 ps.il[ps.tos] = ps.i_l_follow; in parse()
145 if (ps.p_stack[ps.tos] == dohead) { in parse()
147 ps.ind_level = ps.i_l_follow = ps.il[ps.tos]; in parse()
148 ps.p_stack[++ps.tos] = whilestmt; in parse()
149 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow; in parse()
152 ps.p_stack[++ps.tos] = whilestmt; in parse()
153 ps.il[ps.tos] = ps.i_l_follow; in parse()
154 ++ps.i_l_follow; in parse()
155 ps.search_brace = opt.btype_2; in parse()
162 if (ps.p_stack[ps.tos] != ifhead) in parse()
165 ps.ind_level = ps.il[ps.tos]; /* indentation for else should in parse()
167 ps.i_l_follow = ps.ind_level + 1; /* everything following should in parse()
169 ps.p_stack[ps.tos] = elsehead; in parse()
171 ps.search_brace = opt.btype_2 | opt.else_if; in parse()
177 if (ps.tos > 0 && ps.p_stack[ps.tos - 1] == lbrace) { in parse()
178 ps.ind_level = ps.i_l_follow = ps.il[--ps.tos]; in parse()
179 ps.p_stack[ps.tos] = stmt; in parse()
186 ps.p_stack[++ps.tos] = swstmt; in parse()
187 ps.cstk[ps.tos] = case_ind; in parse()
189 ps.il[ps.tos] = ps.i_l_follow; in parse()
190 case_ind = ps.i_l_follow + opt.case_indent; /* cases should be one in parse()
193 ps.i_l_follow += opt.case_indent + 1; /* statements should be two in parse()
195 ps.search_brace = opt.btype_2; in parse()
201 ps.p_stack[++ps.tos] = stmt; in parse()
202 ps.il[ps.tos] = ps.ind_level; in parse()
212 if (ps.tos >= STACKSIZE - 1) in parse()
218 for (i = 1; i <= ps.tos; ++i) in parse()
219 printf("(%d %d)", ps.p_stack[i], ps.il[i]); in parse()
273 switch (ps.p_stack[ps.tos]) { in reduce()
276 switch (ps.p_stack[ps.tos - 1]) { in reduce()
281 ps.p_stack[--ps.tos] = stmtl; in reduce()
285 ps.p_stack[--ps.tos] = dohead; in reduce()
286 ps.i_l_follow = ps.il[ps.tos]; in reduce()
291 ps.p_stack[--ps.tos] = ifhead; in reduce()
292 for (i = ps.tos - 1; in reduce()
294 ps.p_stack[i] != stmt in reduce()
296 ps.p_stack[i] != stmtl in reduce()
298 ps.p_stack[i] != lbrace in reduce()
301 ps.i_l_follow = ps.il[i]; in reduce()
311 case_ind = ps.cstk[ps.tos - 1]; in reduce()
320 ps.p_stack[--ps.tos] = stmt; in reduce()
321 ps.i_l_follow = ps.il[ps.tos]; in reduce()
331 if (ps.p_stack[ps.tos - 1] == dohead) { in reduce()
333 ps.tos -= 2; in reduce()