arg = -G
arg[1:2] = -
case - 
flagp = G
arg = -c
arg[1:2] = -
case - 
flagp = c
arg = simp0001
arg[1:2] = s
arg_cnt = 1 arg = simp0001
arg = simp0001.r
arg[1:2] = s
arg_cnt = 2 arg = simp0001.r
arg = simp0001.out
arg[1:2] = s
arg_cnt = 3 arg = simp0001.out
arg = simp0001.sig
arg[1:2] = s
arg_cnt = 4 arg = simp0001.sig
Creating emptylist
Creating emptylist
where                           kind    type(node)
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
mkode return                    4       VarSignature__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
mkode return                    5       ValSignature__state
mkode return                    2       ParameterNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
mkode return                    4       VarSignature__state
mkode return                    2       ParameterNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
mkode return                    6       FSignature__state
mkode return                    10      SignatureSigNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    13      ApplicationNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    13      ApplicationNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    13      ApplicationNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    11      BlDenotationNode__state
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
mkode return                    34      UQStrNode__state
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
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
mkode return                    0       ListHeaderNode__state
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
