Lines Matching defs:actions
201 val actions = map (fn a=>(a,action)) lookahead
203 of nil => (actions,errs)
204 | _ => merge state (reduces,actions,nil,errs)
270 val (actions,errs) = mergeShifts(tableState,
272 val actions' = pruneError actions
273 val (actions,default) =
274 let fun hasReduce (nil,actions) =
275 (rev actions,REDUCE rulenum)
276 | hasReduce ((a as (_,SHIFT _)) :: r,actions) =
277 hasReduce(r,a::actions)
278 | hasReduce (_ :: r,actions) =
279 hasReduce(r,actions)
280 fun loop (nil,actions) = (rev actions,ERROR)
281 | loop ((a as (_,SHIFT _)) :: r,actions) =
282 loop(r,a::actions)
283 | loop ((a as (_,REDUCE _)) :: r,actions) =
284 hasReduce(r,actions)
285 | loop (_ :: r,actions) = loop(r,actions)
287 andalso length actions = length actions'
288 then loop(actions,nil)
289 else (actions',ERROR)
291 in ((actions,default), gotos,errs)
296 val (actions,errs2) =
298 in ((pruneError actions,ERROR),gotos,errs1@errs2)
334 val (actions,gotos,errs) =
342 has accept actions for all of the end-of-parse symbols *)
344 val (actions,gotos,errs) =
346 of nil => (actions,gotos,errs)
351 GotoList.insert((start,STATE (length actions)),h)
352 in (actions @ [newStateActions],
377 val _ = app (fn (actions,default) =>
378 (app (fn (_,r) => test r) actions;
380 ) actions;
392 val numstates = length actions
402 in (mkLrTable {actions=Array.fromList(map (fn (a,b) =>
403 (convert_to_pairlist a,b)) actions),
405 numRules=length rules,numStates=length actions,