arg = -G arg[1:2] = - case - flagp = G arg = -i arg[1:2] = - case - flagp = i arg = misc.r arg[1:2] = m 2nd default arg_cnt = 1 ifname = ofname = sigfname = optfname = arg = misc.out arg[1:2] = m 2nd default arg_cnt = 2 ifname = misc.r ofname = sigfname = optfname = where kind type(node) mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__state mkode return 32 LetterId__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 mkode return 32 LetterId__state mkode return 5 ValSignature__state mkode return 2 ParameterNode__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 mkode return 6 FSignature__state mkode return 6 FSignature__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 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 mkode return 6 FSignature__state mkode return 10 SignatureSigNode__state mkode return 32 LetterId__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mkode return 13 ApplicationNode__state mkode return 32 LetterId__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 13 ApplicationNode__state mkode return 32 LetterId__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 mkode return 31 OpridNode__state 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 mkode return 32 LetterId__state addright dump_info(e) = LetterId__state addright dump_info(e) = LetterId__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 mkode return 32 LetterId__state addright dump_info(e) = LetterId__state addright dump_info(e) = LetterId__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 mkode return 31 OpridNode__state 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 mkode return 33 QStrNode__state addright dump_info(e) = QStrNode__state addright dump_info(e) = QStrNode__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 mkode return 32 LetterId__state addright dump_info(e) = LetterId__state addright dump_info(e) = LetterId__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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 32 LetterId__state addright dump_info(e) = LetterId__state addright dump_info(e) = LetterId__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 mkode return 31 OpridNode__state 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 mkode return 34 UQStrNode__state 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 mkode return 31 OpridNode__state 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 mkode return 32 LetterId__state addright dump_info(e) = LetterId__state addright dump_info(e) = LetterId__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) = LetterId__state length count = 4dump_info(v) = LetterId__state length count = 5dump_info(v) = OpridNode__state length count = 6dump_info(v) = QStrNode__state length count = 7dump_info(v) = LetterId__state length count = 8dump_info(v) = OpridNode__state length count = 9dump_info(v) = UQStrNode__state length count = 10dump_info(v) = OpridNode__state length count = 11dump_info(v) = UQStrNode__state length count = 12dump_info(v) = OpridNode__state length count = 13dump_info(v) = UQStrNode__state length count = 14dump_info(v) = OpridNode__state length count = 15dump_info(v) = UQStrNode__state length count = 16dump_info(v) = OpridNode__state length count = 17dump_info(v) = UQStrNode__state length count = 18dump_info(v) = OpridNode__state length count = 19dump_info(v) = LetterId__state length count = 20dump_info(v) = OpridNode__state length count = 21dump_info(v) = UQStrNode__state length count = 22dump_info(v) = OpridNode__state length count = 23dump_info(v) = LetterId__state list_to_array count = 0dump_info(self.lh_first) = ConsNode__state list to array len = 23 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 = LetterId__state list to array count = 4 v = LetterId__state list to array count = 5 v = OpridNode__state list to array count = 6 v = QStrNode__state list to array count = 7 v = LetterId__state list to array count = 8 v = OpridNode__state list to array count = 9 v = UQStrNode__state list to array count = 10 v = OpridNode__state list to array count = 11 v = UQStrNode__state list to array count = 12 v = OpridNode__state list to array count = 13 v = UQStrNode__state list to array count = 14 v = OpridNode__state list to array count = 15 v = UQStrNode__state list to array count = 16 v = OpridNode__state list to array count = 17 v = UQStrNode__state list to array count = 18 v = OpridNode__state list to array count = 19 v = LetterId__state list to array count = 20 v = OpridNode__state list to array count = 21 v = UQStrNode__state list to array count = 22 v = OpridNode__state list to array count = 23 v = LetterId__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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = QStrNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = QStrNode__state addright dump_info(e) = QStrNode__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 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 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 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 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 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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__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 mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 is empty lh_first - FALSE is empty lh_first - FALSE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 l.lh_first TRUE is empty l.lh_first TRUE mkode return 13 ApplicationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 cn_hd_field = ApplicationNode__state cn_tl_field = null Unique Id = 164