arg = -G arg[1:2] = - case - flagp = G arg = -i arg[1:2] = - case - flagp = i arg = fact.r arg[1:2] = f 2nd default arg_cnt = 1 ifname = ofname = sigfname = optfname = arg = fact.out arg[1:2] = f 2nd default arg_cnt = 2 ifname = fact.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 31 OpridNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 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 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 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 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 mkode return 5 ValSignature__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state IN SPLIT IN SPLIT Split mkode return 6 FSignature__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 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 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 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 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 mkode return 32 LetterId__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 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 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 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 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 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 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 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 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 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 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 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 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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mkode return 11 BlDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = BlDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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 IN LENGTH length count = 0dump_info(self.lh_first) = ConsNode__state length count = 1dump_info(v) = BlDenotationNode__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 = BlDenotationNode__state list to array count = 2 v = OpridNode__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 = 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 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 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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mkode return 11 BlDenotationNode__state addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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) = BlDenotationNode__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 = BlDenotationNode__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 = BlDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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 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 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 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 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 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 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 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 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 mkode return 32 LetterId__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 IN LENGTH length count = 0dump_info(self.lh_first) = ConsNode__state length count = 1dump_info(v) = ConsNode__state 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 mkode return 28 GuardedListNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 mkode return 0 ListHeaderNode__state 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 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 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 mkode return 0 ListHeaderNode__state mklist type p = FSignature__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = FSignature__state addright dump_info(e) = FSignature__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) = FSignature__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 = FSignature__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = FSignature__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = FSignature__state addright dump_info(e) = FSignature__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 mkode return 0 ListHeaderNode__state IN SPLIT IN SPLIT Split 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 32 LetterId__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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 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 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 = LetterId__state list to array count = 2 v = ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state IN SPLIT IN SPLIT Split is empty l.lh_first TRUE is empty l.lh_first TRUE Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state is empty l.lh_first TRUE is empty l.lh_first TRUE 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 33 QStrNode__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 IN LENGTH length count = 0dump_info(self.lh_first) = ConsNode__state length count = 1dump_info(v) = QStrNode__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 = QStrNode__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 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 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 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 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 = LetterId__state list to array count = 2 v = ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 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 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 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 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 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 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 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 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) = ListHeaderNode__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 = OpridNode__state list to array count = 3 v = LetterId__state list to array count = 4 v = 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 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 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 Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mkode return 11 BlDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = BlDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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 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 IN LENGTH length count = 0dump_info(self.lh_first) = ConsNode__state length count = 1dump_info(v) = BlDenotationNode__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 = BlDenotationNode__state list to array count = 2 v = OpridNode__state list to array count = 3 v = UQStrNode__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 = 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 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 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 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 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 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 = LetterId__state list to array count = 2 v = OpridNode__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 = 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 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 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 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 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 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 = LetterId__state list to array count = 2 v = ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 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 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 33 QStrNode__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 IN LENGTH length count = 0dump_info(self.lh_first) = ConsNode__state length count = 1dump_info(v) = QStrNode__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 = QStrNode__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 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 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 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 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 = LetterId__state list to array count = 2 v = ListHeaderNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 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) = ConsNode__state length count = 2dump_info(v) = ConsNode__state Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mkode return 11 BlDenotationNode__state mkode return 30 GuardedElementNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state 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 mkode return 29 LoopDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = LoopDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = LoopDenotationNode__state addright dump_info(e) = LoopDenotationNode__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) = LoopDenotationNode__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 = LoopDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = LoopDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = LoopDenotationNode__state addright dump_info(e) = LoopDenotationNode__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 mkode return 11 BlDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = BlDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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) = BlDenotationNode__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 = BlDenotationNode__state mklist va_alist mklist va_alist mklist va_alist Creating emptylist Creating emptylist mkode return 0 ListHeaderNode__state mklist type p = BlDenotationNode__state mklist l before addright(l,p) mklist p before addright(l,p) addright dump_info(e) = BlDenotationNode__state addright dump_info(e) = BlDenotationNode__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 = BlDenotationNode__state cn_tl_field = null Unique Id = 314