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 unique id = 1
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 2
Node [new] knd = 32 LETTERID unique id = 3
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 4
Node [new] knd = 32 LETTERID unique id = 5
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 6
Node [new] knd = 32 LETTERID unique id = 7
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 8
Node [new] knd = 32 LETTERID unique id = 9
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 10
Node [new] knd = 32 LETTERID unique id = 11
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 12
Node [new] knd = 32 LETTERID unique id = 13
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 14
Node [new] knd = 32 LETTERID unique id = 15
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 16
Node [new] knd = 32 LETTERID unique id = 17
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 18
Node [new] knd = 32 LETTERID unique id = 19
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 20
Node [new] knd = 5 VALSIGNATURE unique id = 21
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 22
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 23
Node [new] knd = 5 VALSIGNATURE unique id = 24
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 25
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 26
Node [new] knd = 5 VALSIGNATURE unique id = 27
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 28
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 29
Node [new] knd = 4 VARSIGNATURE unique id = 30
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 31
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 32
Node [new] knd = 32 LETTERID unique id = 33
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 34
Node [new] knd = 5 VALSIGNATURE unique id = 35
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 36
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 37
Node [new] knd = 2 PARAMETER unique id = 38
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 39
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 40
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 41
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 42
Node [new] knd = 32 LETTERID unique id = 43
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 44
Node [new] knd = 4 VARSIGNATURE unique id = 45
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 46
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 47
Node [new] knd = 2 PARAMETER unique id = 48
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 49
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 50
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 51
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 52
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 53
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 56
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 59
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 6 FUNCSIGNATURE unique id = 62
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 63
Node [new] knd = 6 FUNCSIGNATURE unique id = 64
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 65
Node [new] knd = 6 FUNCSIGNATURE unique id = 66
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 67
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 68
Node [new] knd = 6 FUNCSIGNATURE unique id = 69
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 70
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 71
Node [new] knd = 6 FUNCSIGNATURE unique id = 72
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 73
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 74
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
par_id   =          null
par_signature   =   ListHeaderNode__state
displacement   =    null
level   =           null
par_previous_definitListHeaderNode__state
par_scope   =       ListHeaderNode__state
par_only_def   =    ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = ParameterNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         9999
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         9999
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 6 FUNCSIGNATURE unique id = 76
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 77
Node [new] knd = 10 SIGNATURESIG unique id = 78
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 79
Node [new] knd = 32 LETTERID unique id = 80
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 81
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 82
Node [new] knd = 13 APPLICATION unique id = 83
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 84
Node [new] knd = 32 LETTERID unique id = 85
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 86
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 87
Node [new] knd = 13 APPLICATION unique id = 88
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 89
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 90
Node [new] knd = 13 APPLICATION unique id = 91
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 92
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 93
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
Node [new] knd = 11 BLOCKDENOTATION unique id = 94
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 95
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 96
pos_no = 1 unique_id = 95
pos_no = 1 unique_id = 96
Node [new] knd = 31 OPRID unique id = 97
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 98
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 99
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 101
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 102
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 103
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 105
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 106
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 107
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 109
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Node [new] knd = 5 VALSIGNATURE unique id = 111
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 112
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 113
Node [new] knd = 6 FUNCSIGNATURE unique id = 114
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 115
Node [new] knd = 32 LETTERID unique id = 116
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 117
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 118
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 120
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 121
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 34 UQSTR unique id = 123
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 124
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 126
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 128
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 129
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 130
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 131
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 133
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 134
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 135
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID unique id = 137
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 138
Node [new] knd = 32 LETTERID unique id = 139
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 140
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 141
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 143
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 144
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 145
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 147
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 149
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 31 OPRID unique id = 152
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 153
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID unique id = 155
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 156
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 157
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 159
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 160
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 34 UQSTR unique id = 162
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 163
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 165
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 167
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 168
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 169
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 170
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 172
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 173
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 174
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 176
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 178
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 180
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 181
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 183
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 185
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 186
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 187
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 188
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 190
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
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
Node [new] knd = 0 LISTHEADER unique id = 193
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 194
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 195
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 196
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 198
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 199
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 200
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ConsNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 202
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 203
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 204
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 206
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Node [new] knd = 2 PARAMETER unique id = 208
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 209
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 210
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 211
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
ge_guard   =        ListHeaderNode__state
ge_element   =      ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 213
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 214
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 215
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 217
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 218
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 34 UQSTR unique id = 220
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 221
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 223
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 225
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 226
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 227
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 228
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 230
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 231
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 232
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID unique id = 234
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 235
Node [new] knd = 34 UQSTR unique id = 236
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 237
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 238
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 240
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        LetterId__state
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 242
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     UQStrNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     UQStrNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Node [new] knd = 2 PARAMETER unique id = 244
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 245
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 246
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 28 GUARDEDLIST unique id = 248
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 249
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 250
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = GuardedListNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 252
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = GuardedListNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            28
kind name =         GUARDEDLIST
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 254
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     GuardedListNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     GuardedListNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = ConsNode__state
Node [new] knd = 35 FUNCCONSTR unique id = 256
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 257
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 258
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 259
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 260
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 261
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 262
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 263
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = FConstruction__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 265
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = FConstruction__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            35
kind name =         FUNCCONSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 267
IN SPLIT
listops split kindno = 1 DECLARATION argcnt = 16
Node [new] knd = 1 DECLARATION unique id = 268
ENTER addright l = ListHeaderNode__state e = DeclarationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            1
kind name =         DECLARATION
vlineno   =         2
pre_num   =         null
post_num   =        null
decl_id   =         null
decl_denotation   = null
displacement   =    null
level   =           null
decl_signature   =  null
decl_done   =       null
decl_sig_transp   = null
decl_innermost_id   null
decl_previous_defininull
decl_scope   =      null
decl_can_be_refd   =null
decl_special   =    null
decl_sel_index   =  null
decl_needed   =     null
decl_const_val   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = DeclarationNode__state
ConsNode [new] hd = DeclarationNode__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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
BEGIN RETURN Split
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN Split
Node [new] knd = 32 LETTERID unique id = 270
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 271
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 272
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 274
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 275
Node [new] knd = 32 LETTERID unique id = 276
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 277
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 278
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 280
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 282
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 283
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 284
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 285
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 287
IN SPLIT
listops split kindno = 1 DECLARATION argcnt = 16
Node [new] knd = 1 DECLARATION unique id = 288
ENTER addright l = ListHeaderNode__state e = DeclarationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            1
kind name =         DECLARATION
vlineno   =         2
pre_num   =         null
post_num   =        null
decl_id   =         null
decl_denotation   = null
displacement   =    null
level   =           null
decl_signature   =  null
decl_done   =       null
decl_sig_transp   = null
decl_innermost_id   null
decl_previous_defininull
decl_scope   =      null
decl_can_be_refd   =null
decl_special   =    null
decl_sel_index   =  null
decl_needed   =     null
decl_const_val   =  null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = DeclarationNode__state
ConsNode [new] hd = DeclarationNode__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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
BEGIN RETURN Split
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN Split
is empty lh_first - FALSE
is empty lh_first - FALSE
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 290
is empty lh_first - FALSE
is empty l.lh_first TRUE
Node [new] knd = 32 LETTERID unique id = 291
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 292
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 293
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 33 QSTR unique id = 295
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 296
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 297
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 299
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 301
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 304
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 305
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 306
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 307
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 309
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 311
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 312
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 313
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 315
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 316
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID unique id = 318
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 319
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 32 LETTERID unique id = 321
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 322
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 323
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 325
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 327
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LetterId__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 330
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 332
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 333
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 334
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 335
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 337
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 338
Node [new] knd = 13 APPLICATION unique id = 339
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 340
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 341
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 344
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
Node [new] knd = 11 BLOCKDENOTATION unique id = 345
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 346
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 347
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 348
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 350
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 351
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
Node [new] knd = 34 UQSTR unique id = 353
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 354
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 356
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 358
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 359
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 360
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 361
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = UQStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            34
kind name =         UQSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 13 APPLICATION unique id = 363
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 364
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 365
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
Node [new] knd = 32 LETTERID unique id = 367
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 368
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 369
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 371
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 372
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 373
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 31 OPRID unique id = 375
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 376
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 378
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = OpridNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            31
kind name =         OPRID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 380
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 381
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 382
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 383
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 385
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 388
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 389
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 390
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 391
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 393
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 32 LETTERID unique id = 395
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 396
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 397
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = LetterId__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            32
kind name =         LETTERID
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 33 QSTR unique id = 399
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 400
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 401
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 403
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
sel_type   =        null
str_string   =      null
str_use_list   =    ListHeaderNode__state
str_expansion   =   null
ENTER addright l = ListHeaderNode__state e = QStrNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            33
kind name =         QSTR
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 405
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     QStrNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ENTER addright l = ListHeaderNode__state e = ListHeaderNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
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
Node [new] knd = 0 LISTHEADER unique id = 408
is empty l.lh_first TRUE
Node [new] knd = 13 APPLICATION unique id = 409
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 410
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 411
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
ap_operator   =     null
ap_args   =         ListHeaderNode__state
ap_void_decl   =    null
ENTER addright l = ListHeaderNode__state e = ApplicationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            13
kind name =         APPLICATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
cn_hd_field   =     ApplicationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
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
Node [new] knd = 0 LISTHEADER unique id = 414
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
Node [new] knd = 11 BLOCKDENOTATION unique id = 415
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 416
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 417
Node [new] knd = 2 PARAMETER unique id = 418
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 419
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 420
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 421
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
ge_guard   =        ListHeaderNode__state
ge_element   =      ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = GuardedElementNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            2
kind name =         PARAMETER
vlineno   =         null
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
Node [new] knd = 29 LOOPDENOTATION unique id = 423
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 424
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 425
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = LoopDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 427
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
signature   =       null
sig_done   =        null
gl_list   =         ListHeaderNode__state
ENTER addright l = ListHeaderNode__state e = LoopDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            29
kind name =         LOOPDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 429
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LoopDenotationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     LoopDenotationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
ListHeaderNode[new] knd = 11 BLOCKDENOTATION first = null last = null
Node [new] knd = 11 BLOCKDENOTATION unique id = 431
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 432
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 433
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 434
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
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
Node [new] knd = 0 LISTHEADER unique id = 436
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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
ENTER addright l = ListHeaderNode__state e = BlDenotationNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
kind   =            11
kind name =         BLOCKDENOTATION
vlineno   =         2
pre_num   =         null
post_num   =        null
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] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
is empty lh_first - FALSE
mklist va_alist
Creating emptylist
ListHeaderNode[new] knd = 0 LISTHEADER first = null last = null
Node [new] knd = 0 LISTHEADER unique id = 438
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     BlDenotationNode__state
cn_tl_field   =     null
ENTER addright l = ListHeaderNode__state e = ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        null
lh_last   =         null
cn_hd_field   =     BlDenotationNode__state
cn_tl_field   =     null
END ENTER INFO
Should add e to beginning of list l
addright dump_info(e) = ConsNode__state
ConsNode [new] 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
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
END RETURN INFO
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
kind   =            0
kind name =         LISTHEADER
vlineno   =         2
pre_num   =         null
post_num   =        null
lh_first   =        ConsNode__state
lh_last   =         ConsNode__state
pos_no = 2 unique_id = 95
pos_no = 2 unique_id = 438
pos_no = 2 unique_id = 439
pos_no = 2 unique_id = 437
pos_no = 2 unique_id = 431
pos_no = 2 unique_id = 432
pos_no = 2 unique_id = 433
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
pos_no = 3 unique_id = 95
pos_no = 3 unique_id = 438
pos_no = 3 unique_id = 439
pos_no = 3 unique_id = 437
pos_no = 3 unique_id = 431
pos_no = 3 unique_id = 432
pos_no = 3 unique_id = 433
pos_no = 4 unique_id = 95
pos_no = 4 unique_id = 438
pos_no = 4 unique_id = 439
pos_no = 4 unique_id = 437
pos_no = 4 unique_id = 431
pos_no = 4 unique_id = 432
pos_no = 4 unique_id = 433
IN LENGTH
length count = 0dump_info(self.lh_first) = null
IN LENGTH
length count = 0dump_info(self.lh_first) = null
