arg = -G
arg[1:2] = -
case - 
flagp = G
arg = -c
arg[1:2] = -
case - 
flagp = c
arg = fact
arg[1:2] = f
arg_cnt = 1 arg = fact
arg = fact.r
arg[1:2] = f
arg_cnt = 2 arg = fact.r
arg = fact.out
arg[1:2] = f
arg_cnt = 3 arg = fact.out
arg = fact.sig
arg[1:2] = f
arg_cnt = 4 arg = fact.sig
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
mklist l after addright(l,p)
mklist done
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
mklist l after addright(l,p)
mklist done
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
is empty l.lh_first TRUE
is empty l.lh_first TRUE
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
addright dump_info(e) = ListHeaderNode__state
addright dump_info(e) = ListHeaderNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
is empty l.lh_first TRUE
is empty l.lh_first TRUE
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
length count = 2dump_info(v) = OpridNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = ConsNode__state
list to array count = 2 v = OpridNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
is empty l.lh_first TRUE
is empty l.lh_first TRUE
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
length count = 3dump_info(v) = OpridNode__state
length count = 4dump_info(v) = ConsNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 4 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
list to array count = 3 v = OpridNode__state
list to array count = 4 v = ConsNode__state
Creating emptylist
Creating emptylist
is empty l.lh_first TRUE
is empty l.lh_first TRUE
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = GuardedElementNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = GuardedElementNode__state
addright dump_info(e) = GuardedElementNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = LetterId__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = OpridNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
is empty l.lh_first TRUE
is empty l.lh_first TRUE
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = UQStrNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
addright dump_info(e) = GuardedElementNode__state
addright dump_info(e) = GuardedElementNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright return
Creating emptylist
Creating emptylist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = GuardedListNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = GuardedListNode__state
addright dump_info(e) = GuardedListNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = GuardedListNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = GuardedListNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = GuardedListNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = GuardedListNode__state
addright dump_info(e) = GuardedListNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = ConsNode__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ConsNode__state
addright dump_info(e) = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mklist type p = FConstruction__state
mklist l before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = FConstruction__state
addright dump_info(e) = FConstruction__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
mklist l after addright(l,p)
mklist done
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = FConstruction__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = FConstruction__state
