arg = -G
arg[1:2] = -
case - 
flagp = G
arg = -c
arg[1:2] = -
case - 
flagp = c
arg = fact
arg[1:2] = f
arg_cnt = 1 arg = fact
arg = fact.r
arg[1:2] = f
arg_cnt = 2 arg = fact.r
arg = fact.out
arg[1:2] = f
arg_cnt = 3 arg = fact.out
arg = fact.sig
arg[1:2] = f
arg_cnt = 4 arg = fact.sig
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 1 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 2 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 3 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 4 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 5 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 6 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 7 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 8 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 9 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 10 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 11 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 12 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 13 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 14 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 15 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 16 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 17 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 18 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 19 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 20 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 21 hd = null tl = null
Node [new] knd = 5 VALSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 22 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 23 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 24 hd = null tl = null
Node [new] knd = 5 VALSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 25 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 26 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 27 hd = null tl = null
Node [new] knd = 5 VALSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 28 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 29 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 30 hd = null tl = null
Node [new] knd = 4 VARSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 31 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 32 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 33 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 34 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 35 hd = null tl = null
Node [new] knd = 5 VALSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 36 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 37 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 38 hd = null tl = null
Node [new] knd = 2 PARAMETER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 39 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 40 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 41 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 42 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 43 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 44 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 45 hd = null tl = null
Node [new] knd = 4 VARSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 46 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 47 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 48 hd = null tl = null
Node [new] knd = 2 PARAMETER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 49 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 50 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 51 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 52 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 53 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       53
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       48
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 54 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       53
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       53
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       38
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 55 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       53
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 56 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       56
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       38
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 57 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       56
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       56
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       38
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 58 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       56
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 59 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       59
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       48
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 60 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       59
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       59
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       48
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 61 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       59
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 62 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 63 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 64 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 65 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 66 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 67 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 68 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 69 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 70 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 71 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 72 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 73 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 74 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       74
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       48
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ParameterNode__state
ConsNode [new] unique_id = 75 hd = ParameterNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       74
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 76 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 77 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 78 hd = null tl = null
Node [new] knd = 10 SIGNATURESIG
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 79 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 80 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 81 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 82 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 83 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 84 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 85 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 86 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 87 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 88 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 89 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 90 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 91 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 92 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 93 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
ConsNode [new] unique_id = 94 hd = null tl = null
Node [new] knd = 11 BLOCKDENOTATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 95 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 96 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 97 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 98 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 99 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       99
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       97
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 100 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       99
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 101 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 102 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 103 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       103
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       101
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 104 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       103
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 105 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 106 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 107 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       107
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       105
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 108 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       107
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 109 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       109
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       105
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 110 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       109
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
ConsNode [new] unique_id = 111 hd = null tl = null
Node [new] knd = 5 VALSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 112 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 113 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 114 hd = null tl = null
Node [new] knd = 6 FUNCSIGNATURE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 115 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 116 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 117 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 118 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       116
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 119 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 120 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 121 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       120
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 122 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 123 hd = null tl = null
Node [new] knd = 34 UQSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 124 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       123
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 125 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       118
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 126 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       126
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       120
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 127 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       126
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 128 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 129 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 130 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 131 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       131
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       123
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 132 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       131
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 133 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 134 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 135 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       135
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       133
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 136 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       135
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 137 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 138 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 139 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 140 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 141 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       139
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 142 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 143 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 144 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 145 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       145
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       143
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 146 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       145
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 147 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       147
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       143
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 148 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       147
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 149 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       149
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
Unique Id   =       148
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 150 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       149
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       149
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 151 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 152 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 153 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       152
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 154 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 155 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 156 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 157 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       155
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 158 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 159 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 160 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       159
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 161 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 162 hd = null tl = null
Node [new] knd = 34 UQSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 163 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       162
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 164 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       157
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 165 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       165
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       159
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 166 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       165
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 167 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 168 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 169 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 170 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       170
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       162
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 171 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       170
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 172 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 173 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 174 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       174
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       172
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 175 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       174
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 176 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       176
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       175
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 177 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       176
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 178 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       178
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
Unique Id   =       177
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 179 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       178
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 180 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 181 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       178
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       180
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 182 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       178
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
length count = 2dump_info(v) = OpridNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 2 tmp = ConsNode__state
list to array count = 1 v = ConsNode__state
list to array count = 2 v = OpridNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 183 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       183
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       180
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 184 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       183
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 185 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 186 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 187 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 188 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       188
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       186
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 189 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       188
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 190 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       190
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       189
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 191 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       190
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
Unique Id   =       191
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 192 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       141
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = ListHeaderNode__state
length count = 3dump_info(v) = OpridNode__state
length count = 4dump_info(v) = ConsNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 4 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = ListHeaderNode__state
list to array count = 3 v = OpridNode__state
list to array count = 4 v = ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 193 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 194 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 195 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 196 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       196
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       152
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 197 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       196
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 198 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 199 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 200 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       200
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
Unique Id   =       191
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 201 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       200
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 202 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 203 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 204 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       204
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       202
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 205 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       204
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 206 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       206
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       205
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 207 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       206
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
ConsNode [new] unique_id = 208 hd = null tl = null
Node [new] knd = 2 PARAMETER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 209 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 210 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 211 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       211
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       208
ge_guard   =        ListHeaderNode__state
ge_element   =      ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = GuardedElementNode__state
ConsNode [new] unique_id = 212 hd = GuardedElementNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       211
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 213 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 214 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 215 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       213
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 216 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 217 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 218 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       217
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 219 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 220 hd = null tl = null
Node [new] knd = 34 UQSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 221 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       220
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 222 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       215
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = UQStrNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 3 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = UQStrNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 223 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       223
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       217
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 224 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       223
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 225 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 226 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 227 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 228 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       228
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       220
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 229 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       228
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 230 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 231 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 232 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       232
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       230
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 233 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       232
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 234 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 235 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 236 hd = null tl = null
Node [new] knd = 34 UQSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 237 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 238 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       238
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       236
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 239 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       238
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 240 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       240
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       236
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 241 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       240
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 242 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       242
lh_first   =        null
lh_last   =         null
cn_hd_field   =     UQStrNode__state
cn_tl_field   =     null
Unique Id   =       241
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 243 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       242
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
ConsNode [new] unique_id = 244 hd = null tl = null
Node [new] knd = 2 PARAMETER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 245 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 246 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       211
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       244
ge_guard   =        ListHeaderNode__state
ge_element   =      ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = GuardedElementNode__state
ConsNode [new] unique_id = 247 hd = GuardedElementNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       211
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 248 hd = null tl = null
Node [new] knd = 28 GUARDEDLIST
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 249 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 250 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = GuardedListNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       250
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       248
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = GuardedListNode__state
ConsNode [new] unique_id = 251 hd = GuardedListNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       250
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 252 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = GuardedListNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       252
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       248
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = GuardedListNode__state
ConsNode [new] unique_id = 253 hd = GuardedListNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       252
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 254 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       254
lh_first   =        null
lh_last   =         null
cn_hd_field   =     GuardedListNode__state
cn_tl_field   =     null
Unique Id   =       253
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 255 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       254
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
ConsNode [new] unique_id = 256 hd = null tl = null
Node [new] knd = 35 FUNCCONSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 257 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 258 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 259 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 260 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 261 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 262 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 263 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = FConstruction__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       263
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       256
signature   =       ListHeaderNode__state
sig_done   =        null
ar_size   =         null
ar_static_link   =  null
ar_static_level   = null
fc_body   =         ListHeaderNode__state
fc_complexity   =   ListHeaderNode__state
fc_code_label   =   ListHeaderNode__state
fc_free_vars   =    ListHeaderNode__state
fc_body_needed   =  ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = FConstruction__state
ConsNode [new] unique_id = 264 hd = FConstruction__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       263
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = FConstruction__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 1 tmp = ConsNode__state
list to array count = 1 v = FConstruction__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 265 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = FConstruction__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       265
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       256
signature   =       ListHeaderNode__state
sig_done   =        null
ar_size   =         null
ar_static_link   =  null
ar_static_level   = null
fc_body   =         ListHeaderNode__state
fc_complexity   =   ListHeaderNode__state
fc_code_label   =   ListHeaderNode__state
fc_free_vars   =    ListHeaderNode__state
fc_body_needed   =  ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = FConstruction__state
ConsNode [new] unique_id = 266 hd = FConstruction__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       265
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 267 hd = null tl = null
Node [new] knd = 0 LISTHEADER
IN SPLIT
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 268 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 269 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 270 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       270
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       268
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 271 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       270
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 272 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 273 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 274 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 275 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 276 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       276
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       274
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 277 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       276
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 278 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       276
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       278
lh_first   =        null
lh_last   =         null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 279 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       276
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 280 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 281 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 282 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 283 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       283
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       281
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 284 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       283
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 285 hd = null tl = null
Node [new] knd = 0 LISTHEADER
IN SPLIT
is empty l.lh_first TRUE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 286 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 287 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 288 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 289 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       289
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       287
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 290 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       289
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 291 hd = null tl = null
Node [new] knd = 33 QSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 292 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 293 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       293
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       291
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = QStrNode__state
ConsNode [new] unique_id = 294 hd = QStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       293
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 295 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       295
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       291
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = QStrNode__state
ConsNode [new] unique_id = 296 hd = QStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       295
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 297 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       297
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
Unique Id   =       296
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 298 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       297
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       289
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       297
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 299 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       289
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 300 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 301 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 302 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 303 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       303
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       301
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 304 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       303
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 305 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       305
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       304
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 306 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       305
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 307 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 308 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 309 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       307
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 310 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 311 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 312 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       311
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 313 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 314 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 315 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       314
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 316 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 317 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 318 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 319 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       319
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       317
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 320 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       319
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 321 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       321
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       317
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 322 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       321
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 323 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       323
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
Unique Id   =       322
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 324 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       323
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       323
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 325 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       309
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 326 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       326
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       311
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 327 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       326
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 328 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 329 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 330 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 331 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       331
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       314
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 332 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       331
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 333 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 334 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 335 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 336 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 337 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       337
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       335
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 338 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       337
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       305
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       338
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 339 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       305
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 340 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
ConsNode [new] unique_id = 341 hd = null tl = null
Node [new] knd = 11 BLOCKDENOTATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 342 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 343 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 344 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       341
lh_first   =        null
lh_last   =         null
signature   =       null
sig_done   =        null
ar_size   =         null
ar_static_link   =  null
ar_static_level   = null
bld_declaration_listListHeaderNode__state
bld_den_seq   =     ListHeaderNode__state
bld_precedence   =  15
bld_flags   =       0
fc_code_label  =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = BlDenotationNode__state
ConsNode [new] unique_id = 345 hd = BlDenotationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 346 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 347 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       346
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 348 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 349 hd = null tl = null
Node [new] knd = 34 UQSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 350 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       349
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 351 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       344
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 352 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       352
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       346
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 353 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       352
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 354 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 355 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 356 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 357 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       357
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       349
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = UQStrNode__state
ConsNode [new] unique_id = 358 hd = UQStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       357
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 359 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 360 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 361 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       361
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       359
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 362 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       361
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 363 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 364 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 365 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       365
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       363
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 366 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       365
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 367 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 368 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 369 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       369
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       367
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 370 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       369
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 371 hd = null tl = null
Node [new] knd = 31 OPRID
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 372 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       369
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       371
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 373 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       369
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 374 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       374
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       371
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = OpridNode__state
ConsNode [new] unique_id = 375 hd = OpridNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       374
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 376 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 377 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 378 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 379 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       379
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       377
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 380 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       379
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 381 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       381
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       380
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 382 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       381
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       365
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       381
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 383 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       365
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 384 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 385 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 386 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 387 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       387
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       385
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 388 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       387
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 389 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       389
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       388
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 390 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       389
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID
ConsNode [new] unique_id = 391 hd = null tl = null
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 392 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 393 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       393
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       391
signature   =       null
sig_done   =        null
sel_type   =        null
id_str_table_index  null
id_use_list   =     ListHeaderNode__state
id_last_definition  null
id_def_found   =    null
sel_index   =       null
id_appl   =         null
id_forward_ref   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LetterId__state
ConsNode [new] unique_id = 394 hd = LetterId__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       393
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 395 hd = null tl = null
Node [new] knd = 33 QSTR
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 396 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 397 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       397
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       395
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = QStrNode__state
ConsNode [new] unique_id = 398 hd = QStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       397
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 399 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       399
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       395
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = QStrNode__state
ConsNode [new] unique_id = 400 hd = QStrNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       399
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 401 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       401
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
Unique Id   =       400
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 402 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       401
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       393
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       401
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ListHeaderNode__state
ConsNode [new] unique_id = 403 hd = ListHeaderNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       393
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 404 hd = null tl = null
Node [new] knd = 0 LISTHEADER
is empty l.lh_first TRUE
ConsNode [new] unique_id = 405 hd = null tl = null
Node [new] knd = 13 APPLICATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 406 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 407 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       407
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       405
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ApplicationNode__state
ConsNode [new] unique_id = 408 hd = ApplicationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       407
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       389
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
Unique Id   =       408
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 409 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       389
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 410 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
ConsNode [new] unique_id = 411 hd = null tl = null
Node [new] knd = 11 BLOCKDENOTATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 412 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 413 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ConsNode [new] unique_id = 414 hd = null tl = null
Node [new] knd = 2 PARAMETER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 415 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 416 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 417 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       417
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       414
ge_guard   =        ListHeaderNode__state
ge_element   =      ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = GuardedElementNode__state
ConsNode [new] unique_id = 418 hd = GuardedElementNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       417
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ConsNode [new] unique_id = 419 hd = null tl = null
Node [new] knd = 29 LOOPDENOTATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 420 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 421 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LoopDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       421
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       419
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LoopDenotationNode__state
ConsNode [new] unique_id = 422 hd = LoopDenotationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       421
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 423 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = LoopDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       423
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       419
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = LoopDenotationNode__state
ConsNode [new] unique_id = 424 hd = LoopDenotationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       423
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 425 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       425
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LoopDenotationNode__state
cn_tl_field   =     null
Unique Id   =       424
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 426 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       425
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
ConsNode [new] unique_id = 427 hd = null tl = null
Node [new] knd = 11 BLOCKDENOTATION
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 428 hd = null tl = null
Node [new] knd = 0 LISTHEADER
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 429 hd = null tl = null
Node [new] knd = 0 LISTHEADER
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 430 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       430
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       427
lh_first   =        null
lh_last   =         null
signature   =       null
sig_done   =        null
ar_size   =         null
ar_static_link   =  null
ar_static_level   = null
bld_declaration_listListHeaderNode__state
bld_den_seq   =     ListHeaderNode__state
bld_precedence   =  15
bld_flags   =       0
fc_code_label  =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = BlDenotationNode__state
ConsNode [new] unique_id = 431 hd = BlDenotationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       430
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
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
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 432 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       432
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       427
lh_first   =        null
lh_last   =         null
signature   =       null
sig_done   =        null
ar_size   =         null
ar_static_link   =  null
ar_static_level   = null
bld_declaration_listListHeaderNode__state
bld_den_seq   =     ListHeaderNode__state
bld_precedence   =  15
bld_flags   =       0
fc_code_label  =    null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = BlDenotationNode__state
ConsNode [new] unique_id = 433 hd = BlDenotationNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       432
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
ConsNode [new] unique_id = 434 hd = null tl = null
Node [new] knd = 0 LISTHEADER
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       434
lh_first   =        null
lh_last   =         null
cn_hd_field   =     BlDenotationNode__state
cn_tl_field   =     null
Unique Id   =       433
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] unique_id = 435 hd = ConsNode__state tl = null
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
RETURN addright l = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       434
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
build_Idtable x = Void set to nil
build_Idtable x = OrdInv set to nil
build_Idtable x = -= set to nil
build_Idtable x = ** set to nil
build_Idtable x = '' set to nil
build_Idtable x = Ord set to nil
build_Idtable x = fact.r set to nil
build_Idtable x = Callcc set to nil
build_Idtable x = ? set to nil
build_Idtable x = / set to nil
build_Idtable x = <:= set to nil
build_Idtable x = New set to nil
build_Idtable x = n set to nil
build_Idtable x = ^ set to nil
build_Idtable x = > set to nil
build_Idtable x = . set to nil
build_Idtable x = and set to nil
build_Idtable x = or set to nil
build_Idtable x = = set to nil
build_Idtable x = - set to nil
build_Idtable x = Last set to nil
build_Idtable x = Short set to nil
build_Idtable x = < set to nil
build_Idtable x = True set to nil
build_Idtable x = + set to nil
build_Idtable x = not set to nil
build_Idtable x = inline set to nil
build_Idtable x = * set to nil
build_Idtable x = init_New set to nil
build_Idtable x = >:= set to nil
build_Idtable x = get set to nil
build_Idtable x = Pred set to nil
build_Idtable x = ptr_New set to nil
build_Idtable x = x set to nil
build_Idtable x = simple set to nil
build_Idtable x = standard set to nil
build_Idtable x = ^+ set to nil
build_Idtable x = FS set to nil
build_Idtable x = += set to nil
build_Idtable x = V set to nil
build_Idtable x = ^* set to nil
build_Idtable x = := set to nil
build_Idtable x = % set to nil
build_Idtable x = Out set to nil
build_Idtable x = init.r set to nil
build_Idtable x = False set to nil
build_Idtable x = In set to nil
build_Idtable x = Long set to nil
build_Idtable x = Succ set to nil
build_Idtable x = size set to nil
build_Idtable x = Mk set to nil
build_Idtable x = Boolean set to nil
build_Idtable x = <> set to nil
build_Idtable x = put set to nil
build_Idtable x = Card set to nil
build_Idtable x = Null set to nil
build_Idtable x = First set to nil
build_Idtable x = Array set to nil
build_Idtable x = >= set to nil
build_Idtable x = ! set to nil
