Hello Russell!
arg = -G
arg[1:2] = -
case - 
flagp = G
arg = -i
arg[1:2] = -
case - 
flagp = i
arg = misc.r
arg[1:2] = m
2nd default
arg_cnt = 1
ifname = 
ofname = 
sigfname = 
optfname = 
arg = misc.out
arg[1:2] = m
2nd default
arg_cnt = 2
ifname = misc.r
ofname = 
sigfname = 
optfname = 
INFO: stt enter stt id = ?
INFO: stt path 1
INFO: stt path 1 sttnstrings = 2
INFO: stt enter stt id = +=
INFO: stt path 1
INFO: stt path 1 sttnstrings = 3
INFO: stt enter stt id = -=
INFO: stt path 1
INFO: stt path 1 sttnstrings = 4
INFO: stt enter stt id = :=
INFO: stt path 1
INFO: stt path 1 sttnstrings = 5
INFO: stt enter stt id = or
INFO: stt path 1
INFO: stt path 1 sttnstrings = 6
INFO: stt enter stt id = and
INFO: stt path 1
INFO: stt path 1 sttnstrings = 7
INFO: stt enter stt id = not
INFO: stt path 1
INFO: stt path 1 sttnstrings = 8
INFO: stt enter stt id = :=
INFO: stt path 2
INFO: stt path 2 it = 5
INFO: stt enter stt id = <
INFO: stt path 1
INFO: stt path 1 sttnstrings = 9
INFO: stt enter stt id = <:=
INFO: stt path 1
INFO: stt path 1 sttnstrings = 10
INFO: stt enter stt id = >:=
INFO: stt path 1
INFO: stt path 1 sttnstrings = 11
INFO: stt enter stt id = <>
INFO: stt path 1
INFO: stt path 1 sttnstrings = 12
INFO: stt enter stt id = >
INFO: stt path 1
INFO: stt path 1 sttnstrings = 13
INFO: stt enter stt id = +
INFO: stt path 1
INFO: stt path 1 sttnstrings = 14
INFO: stt enter stt id = -
INFO: stt path 1
INFO: stt path 1 sttnstrings = 15
INFO: stt enter stt id = *
INFO: stt path 1
INFO: stt path 1 sttnstrings = 16
INFO: stt enter stt id = /
INFO: stt path 1
INFO: stt path 1 sttnstrings = 17
INFO: stt enter stt id = %
INFO: stt path 1
INFO: stt path 1 sttnstrings = 18
INFO: stt enter stt id = ^+
INFO: stt path 1
INFO: stt path 1 sttnstrings = 19
INFO: stt enter stt id = ^*
INFO: stt path 1
INFO: stt path 1 sttnstrings = 20
INFO: stt enter stt id = **
INFO: stt path 1
INFO: stt path 1 sttnstrings = 21
INFO: stt enter stt id = ^
INFO: stt path 1
INFO: stt path 1 sttnstrings = 22
INFO: stt enter stt id = .
INFO: stt path 1
INFO: stt path 1 sttnstrings = 23
INFO: stt enter stt id = New
INFO: stt path 1
INFO: stt path 1 sttnstrings = 24
INFO: stt enter stt id = ptr_New
INFO: stt path 1
INFO: stt path 1 sttnstrings = 25
INFO: stt enter stt id = init_New
INFO: stt path 1
INFO: stt path 1 sttnstrings = 26
INFO: stt enter stt id = V
INFO: stt path 1
INFO: stt path 1 sttnstrings = 27
INFO: stt enter stt id = First
INFO: stt path 1
INFO: stt path 1 sttnstrings = 28
INFO: stt enter stt id = Last
INFO: stt path 1
INFO: stt path 1 sttnstrings = 29
INFO: stt enter stt id = Pred
INFO: stt path 1
INFO: stt path 1 sttnstrings = 30
INFO: stt enter stt id = Succ
INFO: stt path 1
INFO: stt path 1 sttnstrings = 31
INFO: stt enter stt id = Ord
INFO: stt path 1
INFO: stt path 1 sttnstrings = 32
INFO: stt enter stt id = OrdInv
INFO: stt path 1
INFO: stt path 1 sttnstrings = 33
INFO: stt enter stt id = Card
INFO: stt path 1
INFO: stt path 1 sttnstrings = 34
INFO: stt enter stt id = In
INFO: stt path 1
INFO: stt path 1 sttnstrings = 35
INFO: stt enter stt id = Out
INFO: stt path 1
INFO: stt path 1 sttnstrings = 36
INFO: stt enter stt id = Boolean
INFO: stt path 1
INFO: stt path 1 sttnstrings = 37
INFO: stt enter stt id = True
INFO: stt path 1
INFO: stt path 1 sttnstrings = 38
INFO: stt enter stt id = False
INFO: stt path 1
INFO: stt path 1 sttnstrings = 39
INFO: stt enter stt id = Short
INFO: stt path 1
INFO: stt path 1 sttnstrings = 40
INFO: stt enter stt id = Void
INFO: stt path 1
INFO: stt path 1 sttnstrings = 41
INFO: stt enter stt id = Array
INFO: stt path 1
INFO: stt path 1 sttnstrings = 42
INFO: stt enter stt id = put
INFO: stt path 1
INFO: stt path 1 sttnstrings = 43
INFO: stt enter stt id = Callcc
INFO: stt path 1
INFO: stt path 1 sttnstrings = 44
INFO: stt enter stt id = size
INFO: stt path 1
INFO: stt path 1 sttnstrings = 45
INFO: stt enter stt id = ''
INFO: stt path 1
INFO: stt path 1 sttnstrings = 46
INFO: stt enter stt id = simple
INFO: stt path 1
INFO: stt path 1 sttnstrings = 47
INFO: stt enter stt id = standard
INFO: stt path 1
INFO: stt path 1 sttnstrings = 48
INFO: stt enter stt id = inline
INFO: stt path 1
INFO: stt path 1 sttnstrings = 49
INFO: stt enter stt id = Mk
INFO: stt path 1
INFO: stt path 1 sttnstrings = 50
INFO: stt enter stt id = Null
INFO: stt path 1
INFO: stt path 1 sttnstrings = 51
INFO: mknode va_alist
where                           kind    type(node)
where                           kind    type(node)
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
INFO: mknode va_alist
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
INFO: mknode va_alist
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
INFO: mknode va_alist
mkode return                    4       VarSignature__state
mkode return                    4       VarSignature__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    5       ValSignature__state
mkode return                    5       ValSignature__state
INFO: mknode va_alist
mkode return                    2       ParameterNode__state
mkode return                    2       ParameterNode__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: mknode va_alist
mkode return                    4       VarSignature__state
mkode return                    4       VarSignature__state
INFO: mknode va_alist
mkode return                    2       ParameterNode__state
mkode return                    2       ParameterNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ParameterNode__state
mklist type p = ParameterNode__state
INFO: mklist type p = ParameterNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright dump_info(e) = ParameterNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mknode va_alist
mkode return                    6       FSignature__state
mkode return                    6       FSignature__state
INFO: mknode va_alist
mkode return                    10      SignatureSigNode__state
mkode return                    10      SignatureSigNode__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: Calling yyparse
INFO: cclass1 c = 

INFO: cclass WHTCC
INFO: getchr linebuf = 
INFO: in while *linebuf = 38
INFO:  after read linebuf =  (* Comment Trying Russell Language *)
INFO: ch =  
INFO: scan getchr read linebuf = (* Comment Trying Russell Language *)ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = (* Comment Trying Russell Language *)
INFO: in while *linebuf = 37
INFO:  after read linebuf = (* Comment Trying Russell Language *)
INFO: ch = (
INFO: scan getchr read linebuf = * Comment Trying Russell Language *)ch = (
INFO: cclass1 c = (
INFO: cclass c = (cctab[c] = 4
INFO: getchr linebuf = * Comment Trying Russell Language *)
INFO: in while *linebuf = 36
INFO:  after read linebuf = * Comment Trying Russell Language *)
INFO: ch = *
INFO: scan getchr read linebuf =  Comment Trying Russell Language *)ch = *
INFO: getchr linebuf =  Comment Trying Russell Language *)
INFO: in while *linebuf = 35
INFO:  after read linebuf =  Comment Trying Russell Language *)
INFO: ch =  
INFO: scan getchr read linebuf = Comment Trying Russell Language *)ch =  
INFO: getchr linebuf = Comment Trying Russell Language *)
INFO: in while *linebuf = 34
INFO:  after read linebuf = Comment Trying Russell Language *)
INFO: ch = C
INFO: scan getchr read linebuf = omment Trying Russell Language *)ch = C
INFO: getchr linebuf = omment Trying Russell Language *)
INFO: in while *linebuf = 33
INFO:  after read linebuf = omment Trying Russell Language *)
INFO: ch = o
INFO: scan getchr read linebuf = mment Trying Russell Language *)ch = o
INFO: getchr linebuf = mment Trying Russell Language *)
INFO: in while *linebuf = 32
INFO:  after read linebuf = mment Trying Russell Language *)
INFO: ch = m
INFO: scan getchr read linebuf = ment Trying Russell Language *)ch = m
INFO: getchr linebuf = ment Trying Russell Language *)
INFO: in while *linebuf = 31
INFO:  after read linebuf = ment Trying Russell Language *)
INFO: ch = m
INFO: scan getchr read linebuf = ent Trying Russell Language *)ch = m
INFO: getchr linebuf = ent Trying Russell Language *)
INFO: in while *linebuf = 30
INFO:  after read linebuf = ent Trying Russell Language *)
INFO: ch = e
INFO: scan getchr read linebuf = nt Trying Russell Language *)ch = e
INFO: getchr linebuf = nt Trying Russell Language *)
INFO: in while *linebuf = 29
INFO:  after read linebuf = nt Trying Russell Language *)
INFO: ch = n
INFO: scan getchr read linebuf = t Trying Russell Language *)ch = n
INFO: getchr linebuf = t Trying Russell Language *)
INFO: in while *linebuf = 28
INFO:  after read linebuf = t Trying Russell Language *)
INFO: ch = t
INFO: scan getchr read linebuf =  Trying Russell Language *)ch = t
INFO: getchr linebuf =  Trying Russell Language *)
INFO: in while *linebuf = 27
INFO:  after read linebuf =  Trying Russell Language *)
INFO: ch =  
INFO: scan getchr read linebuf = Trying Russell Language *)ch =  
INFO: getchr linebuf = Trying Russell Language *)
INFO: in while *linebuf = 26
INFO:  after read linebuf = Trying Russell Language *)
INFO: ch = T
INFO: scan getchr read linebuf = rying Russell Language *)ch = T
INFO: getchr linebuf = rying Russell Language *)
INFO: in while *linebuf = 25
INFO:  after read linebuf = rying Russell Language *)
INFO: ch = r
INFO: scan getchr read linebuf = ying Russell Language *)ch = r
INFO: getchr linebuf = ying Russell Language *)
INFO: in while *linebuf = 24
INFO:  after read linebuf = ying Russell Language *)
INFO: ch = y
INFO: scan getchr read linebuf = ing Russell Language *)ch = y
INFO: getchr linebuf = ing Russell Language *)
INFO: in while *linebuf = 23
INFO:  after read linebuf = ing Russell Language *)
INFO: ch = i
INFO: scan getchr read linebuf = ng Russell Language *)ch = i
INFO: getchr linebuf = ng Russell Language *)
INFO: in while *linebuf = 22
INFO:  after read linebuf = ng Russell Language *)
INFO: ch = n
INFO: scan getchr read linebuf = g Russell Language *)ch = n
INFO: getchr linebuf = g Russell Language *)
INFO: in while *linebuf = 21
INFO:  after read linebuf = g Russell Language *)
INFO: ch = g
INFO: scan getchr read linebuf =  Russell Language *)ch = g
INFO: getchr linebuf =  Russell Language *)
INFO: in while *linebuf = 20
INFO:  after read linebuf =  Russell Language *)
INFO: ch =  
INFO: scan getchr read linebuf = Russell Language *)ch =  
INFO: getchr linebuf = Russell Language *)
INFO: in while *linebuf = 19
INFO:  after read linebuf = Russell Language *)
INFO: ch = R
INFO: scan getchr read linebuf = ussell Language *)ch = R
INFO: getchr linebuf = ussell Language *)
INFO: in while *linebuf = 18
INFO:  after read linebuf = ussell Language *)
INFO: ch = u
INFO: scan getchr read linebuf = ssell Language *)ch = u
INFO: getchr linebuf = ssell Language *)
INFO: in while *linebuf = 17
INFO:  after read linebuf = ssell Language *)
INFO: ch = s
INFO: scan getchr read linebuf = sell Language *)ch = s
INFO: getchr linebuf = sell Language *)
INFO: in while *linebuf = 16
INFO:  after read linebuf = sell Language *)
INFO: ch = s
INFO: scan getchr read linebuf = ell Language *)ch = s
INFO: getchr linebuf = ell Language *)
INFO: in while *linebuf = 15
INFO:  after read linebuf = ell Language *)
INFO: ch = e
INFO: scan getchr read linebuf = ll Language *)ch = e
INFO: getchr linebuf = ll Language *)
INFO: in while *linebuf = 14
INFO:  after read linebuf = ll Language *)
INFO: ch = l
INFO: scan getchr read linebuf = l Language *)ch = l
INFO: getchr linebuf = l Language *)
INFO: in while *linebuf = 13
INFO:  after read linebuf = l Language *)
INFO: ch = l
INFO: scan getchr read linebuf =  Language *)ch = l
INFO: getchr linebuf =  Language *)
INFO: in while *linebuf = 12
INFO:  after read linebuf =  Language *)
INFO: ch =  
INFO: scan getchr read linebuf = Language *)ch =  
INFO: getchr linebuf = Language *)
INFO: in while *linebuf = 11
INFO:  after read linebuf = Language *)
INFO: ch = L
INFO: scan getchr read linebuf = anguage *)ch = L
INFO: getchr linebuf = anguage *)
INFO: in while *linebuf = 10
INFO:  after read linebuf = anguage *)
INFO: ch = a
INFO: scan getchr read linebuf = nguage *)ch = a
INFO: getchr linebuf = nguage *)
INFO: in while *linebuf = 9
INFO:  after read linebuf = nguage *)
INFO: ch = n
INFO: scan getchr read linebuf = guage *)ch = n
INFO: getchr linebuf = guage *)
INFO: in while *linebuf = 8
INFO:  after read linebuf = guage *)
INFO: ch = g
INFO: scan getchr read linebuf = uage *)ch = g
INFO: getchr linebuf = uage *)
INFO: in while *linebuf = 7
INFO:  after read linebuf = uage *)
INFO: ch = u
INFO: scan getchr read linebuf = age *)ch = u
INFO: getchr linebuf = age *)
INFO: in while *linebuf = 6
INFO:  after read linebuf = age *)
INFO: ch = a
INFO: scan getchr read linebuf = ge *)ch = a
INFO: getchr linebuf = ge *)
INFO: in while *linebuf = 5
INFO:  after read linebuf = ge *)
INFO: ch = g
INFO: scan getchr read linebuf = e *)ch = g
INFO: getchr linebuf = e *)
INFO: in while *linebuf = 4
INFO:  after read linebuf = e *)
INFO: ch = e
INFO: scan getchr read linebuf =  *)ch = e
INFO: getchr linebuf =  *)
INFO: in while *linebuf = 3
INFO:  after read linebuf =  *)
INFO: ch =  
INFO: scan getchr read linebuf = *)ch =  
INFO: getchr linebuf = *)
INFO: in while *linebuf = 2
INFO:  after read linebuf = *)
INFO: ch = *
INFO: scan getchr read linebuf = )ch = *
INFO: getchr linebuf = )
INFO: in while *linebuf = 1
INFO:  after read linebuf = )
INFO: ch = )
INFO: scan getchr read linebuf = ch = )
INFO: getchr linebuf = 
INFO: in while *linebuf = 24
INFO:  after read linebuf =  x := 'Bertrand Russell'
INFO: ch =  
INFO: scan getchr read linebuf = x := 'Bertrand Russell'ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = x := 'Bertrand Russell'
INFO: in while *linebuf = 23
INFO:  after read linebuf = x := 'Bertrand Russell'
INFO: ch = x
INFO: scan getchr read linebuf =  := 'Bertrand Russell'ch = x
INFO: cclass1 c = x
INFO: cclass c = xcctab[c] = 2
INFO: getchr linebuf =  := 'Bertrand Russell'
INFO: in while *linebuf = 22
INFO:  after read linebuf =  := 'Bertrand Russell'
INFO: ch =  
INFO: scan getchr read linebuf = := 'Bertrand Russell'ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_id p = x
INFO: stt enter stt id = x
INFO: stt path 1
INFO: stt path 1 sttnstrings = 52
INFO: Parser: action = 1
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = := 'Bertrand Russell'
INFO: in while *linebuf = 21
INFO:  after read linebuf = := 'Bertrand Russell'
INFO: ch = :
INFO: scan getchr read linebuf = = 'Bertrand Russell'ch = :
INFO: cclass1 c = :
INFO: cclass c = :cctab[c] = 5
INFO: getchr linebuf = = 'Bertrand Russell'
INFO: in while *linebuf = 20
INFO:  after read linebuf = = 'Bertrand Russell'
INFO: ch = =
INFO: scan getchr read linebuf =  'Bertrand Russell'ch = =
INFO: cclass1 c = =
INFO: cclass c = =cctab[c] = 5
INFO: getchr linebuf =  'Bertrand Russell'
INFO: in while *linebuf = 19
INFO:  after read linebuf =  'Bertrand Russell'
INFO: ch =  
INFO: scan getchr read linebuf = 'Bertrand Russell'ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = :=
INFO: stt enter stt id = :=
INFO: stt path 2
INFO: stt path 2 it = 5
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 53
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = LetterId__state
mklist type p = LetterId__state
INFO: mklist type p = LetterId__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 'Bertrand Russell'
INFO: in while *linebuf = 18
INFO:  after read linebuf = 'Bertrand Russell'
INFO: ch = '
INFO: scan getchr read linebuf = Bertrand Russell'ch = '
INFO: cclass1 c = '
INFO: cclass c = 'cctab[c] = 6
INFO: getchr linebuf = Bertrand Russell'
INFO: in while *linebuf = 17
INFO:  after read linebuf = Bertrand Russell'
INFO: ch = B
INFO: scan getchr read linebuf = ertrand Russell'ch = B
INFO: cclass1 c = B
INFO: cclass c = Bcctab[c] = 2
INFO: getchr linebuf = ertrand Russell'
INFO: in while *linebuf = 16
INFO:  after read linebuf = ertrand Russell'
INFO: ch = e
INFO: scan getchr read linebuf = rtrand Russell'ch = e
INFO: cclass1 c = e
INFO: cclass c = ecctab[c] = 2
INFO: getchr linebuf = rtrand Russell'
INFO: in while *linebuf = 15
INFO:  after read linebuf = rtrand Russell'
INFO: ch = r
INFO: scan getchr read linebuf = trand Russell'ch = r
INFO: cclass1 c = r
INFO: cclass c = rcctab[c] = 2
INFO: getchr linebuf = trand Russell'
INFO: in while *linebuf = 14
INFO:  after read linebuf = trand Russell'
INFO: ch = t
INFO: scan getchr read linebuf = rand Russell'ch = t
INFO: cclass1 c = t
INFO: cclass c = tcctab[c] = 2
INFO: getchr linebuf = rand Russell'
INFO: in while *linebuf = 13
INFO:  after read linebuf = rand Russell'
INFO: ch = r
INFO: scan getchr read linebuf = and Russell'ch = r
INFO: cclass1 c = r
INFO: cclass c = rcctab[c] = 2
INFO: getchr linebuf = and Russell'
INFO: in while *linebuf = 12
INFO:  after read linebuf = and Russell'
INFO: ch = a
INFO: scan getchr read linebuf = nd Russell'ch = a
INFO: cclass1 c = a
INFO: cclass c = acctab[c] = 2
INFO: getchr linebuf = nd Russell'
INFO: in while *linebuf = 11
INFO:  after read linebuf = nd Russell'
INFO: ch = n
INFO: scan getchr read linebuf = d Russell'ch = n
INFO: cclass1 c = n
INFO: cclass c = ncctab[c] = 2
INFO: getchr linebuf = d Russell'
INFO: in while *linebuf = 10
INFO:  after read linebuf = d Russell'
INFO: ch = d
INFO: scan getchr read linebuf =  Russell'ch = d
INFO: cclass1 c = d
INFO: cclass c = dcctab[c] = 2
INFO: getchr linebuf =  Russell'
INFO: in while *linebuf = 9
INFO:  after read linebuf =  Russell'
INFO: ch =  
INFO: scan getchr read linebuf = Russell'ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = Russell'
INFO: in while *linebuf = 8
INFO:  after read linebuf = Russell'
INFO: ch = R
INFO: scan getchr read linebuf = ussell'ch = R
INFO: cclass1 c = R
INFO: cclass c = Rcctab[c] = 2
INFO: getchr linebuf = ussell'
INFO: in while *linebuf = 7
INFO:  after read linebuf = ussell'
INFO: ch = u
INFO: scan getchr read linebuf = ssell'ch = u
INFO: cclass1 c = u
INFO: cclass c = ucctab[c] = 2
INFO: getchr linebuf = ssell'
INFO: in while *linebuf = 6
INFO:  after read linebuf = ssell'
INFO: ch = s
INFO: scan getchr read linebuf = sell'ch = s
INFO: cclass1 c = s
INFO: cclass c = scctab[c] = 2
INFO: getchr linebuf = sell'
INFO: in while *linebuf = 5
INFO:  after read linebuf = sell'
INFO: ch = s
INFO: scan getchr read linebuf = ell'ch = s
INFO: cclass1 c = s
INFO: cclass c = scctab[c] = 2
INFO: getchr linebuf = ell'
INFO: in while *linebuf = 4
INFO:  after read linebuf = ell'
INFO: ch = e
INFO: scan getchr read linebuf = ll'ch = e
INFO: cclass1 c = e
INFO: cclass c = ecctab[c] = 2
INFO: getchr linebuf = ll'
INFO: in while *linebuf = 3
INFO:  after read linebuf = ll'
INFO: ch = l
INFO: scan getchr read linebuf = l'ch = l
INFO: cclass1 c = l
INFO: cclass c = lcctab[c] = 2
INFO: getchr linebuf = l'
INFO: in while *linebuf = 2
INFO:  after read linebuf = l'
INFO: ch = l
INFO: scan getchr read linebuf = 'ch = l
INFO: cclass1 c = l
INFO: cclass c = lcctab[c] = 2
INFO: getchr linebuf = '
INFO: in while *linebuf = 1
INFO:  after read linebuf = '
INFO: ch = '
INFO: scan getchr read linebuf = ch = '
INFO: cclass1 c = '
INFO: cclass c = 'cctab[c] = 6
INFO: getchr linebuf = 
INFO: in while *linebuf = 21
INFO:  after read linebuf =  (* Various Syntax *)
INFO: ch =  
INFO: scan getchr read linebuf = (* Various Syntax *)ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: stt enter stt id = 'Bertrand Russell'
INFO: stt path 1
INFO: stt path 1 sttnstrings = 53
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = (* Various Syntax *)
INFO: in while *linebuf = 20
INFO:  after read linebuf = (* Various Syntax *)
INFO: ch = (
INFO: scan getchr read linebuf = * Various Syntax *)ch = (
INFO: cclass1 c = (
INFO: cclass c = (cctab[c] = 4
INFO: getchr linebuf = * Various Syntax *)
INFO: in while *linebuf = 19
INFO:  after read linebuf = * Various Syntax *)
INFO: ch = *
INFO: scan getchr read linebuf =  Various Syntax *)ch = *
INFO: getchr linebuf =  Various Syntax *)
INFO: in while *linebuf = 18
INFO:  after read linebuf =  Various Syntax *)
INFO: ch =  
INFO: scan getchr read linebuf = Various Syntax *)ch =  
INFO: getchr linebuf = Various Syntax *)
INFO: in while *linebuf = 17
INFO:  after read linebuf = Various Syntax *)
INFO: ch = V
INFO: scan getchr read linebuf = arious Syntax *)ch = V
INFO: getchr linebuf = arious Syntax *)
INFO: in while *linebuf = 16
INFO:  after read linebuf = arious Syntax *)
INFO: ch = a
INFO: scan getchr read linebuf = rious Syntax *)ch = a
INFO: getchr linebuf = rious Syntax *)
INFO: in while *linebuf = 15
INFO:  after read linebuf = rious Syntax *)
INFO: ch = r
INFO: scan getchr read linebuf = ious Syntax *)ch = r
INFO: getchr linebuf = ious Syntax *)
INFO: in while *linebuf = 14
INFO:  after read linebuf = ious Syntax *)
INFO: ch = i
INFO: scan getchr read linebuf = ous Syntax *)ch = i
INFO: getchr linebuf = ous Syntax *)
INFO: in while *linebuf = 13
INFO:  after read linebuf = ous Syntax *)
INFO: ch = o
INFO: scan getchr read linebuf = us Syntax *)ch = o
INFO: getchr linebuf = us Syntax *)
INFO: in while *linebuf = 12
INFO:  after read linebuf = us Syntax *)
INFO: ch = u
INFO: scan getchr read linebuf = s Syntax *)ch = u
INFO: getchr linebuf = s Syntax *)
INFO: in while *linebuf = 11
INFO:  after read linebuf = s Syntax *)
INFO: ch = s
INFO: scan getchr read linebuf =  Syntax *)ch = s
INFO: getchr linebuf =  Syntax *)
INFO: in while *linebuf = 10
INFO:  after read linebuf =  Syntax *)
INFO: ch =  
INFO: scan getchr read linebuf = Syntax *)ch =  
INFO: getchr linebuf = Syntax *)
INFO: in while *linebuf = 9
INFO:  after read linebuf = Syntax *)
INFO: ch = S
INFO: scan getchr read linebuf = yntax *)ch = S
INFO: getchr linebuf = yntax *)
INFO: in while *linebuf = 8
INFO:  after read linebuf = yntax *)
INFO: ch = y
INFO: scan getchr read linebuf = ntax *)ch = y
INFO: getchr linebuf = ntax *)
INFO: in while *linebuf = 7
INFO:  after read linebuf = ntax *)
INFO: ch = n
INFO: scan getchr read linebuf = tax *)ch = n
INFO: getchr linebuf = tax *)
INFO: in while *linebuf = 6
INFO:  after read linebuf = tax *)
INFO: ch = t
INFO: scan getchr read linebuf = ax *)ch = t
INFO: getchr linebuf = ax *)
INFO: in while *linebuf = 5
INFO:  after read linebuf = ax *)
INFO: ch = a
INFO: scan getchr read linebuf = x *)ch = a
INFO: getchr linebuf = x *)
INFO: in while *linebuf = 4
INFO:  after read linebuf = x *)
INFO: ch = x
INFO: scan getchr read linebuf =  *)ch = x
INFO: getchr linebuf =  *)
INFO: in while *linebuf = 3
INFO:  after read linebuf =  *)
INFO: ch =  
INFO: scan getchr read linebuf = *)ch =  
INFO: getchr linebuf = *)
INFO: in while *linebuf = 2
INFO:  after read linebuf = *)
INFO: ch = *
INFO: scan getchr read linebuf = )ch = *
INFO: getchr linebuf = )
INFO: in while *linebuf = 1
INFO:  after read linebuf = )
INFO: ch = )
INFO: scan getchr read linebuf = ch = )
INFO: getchr linebuf = 
INFO: in while *linebuf = 24
INFO:  after read linebuf =  x := "Bertrand Russell"
INFO: ch =  
INFO: scan getchr read linebuf = x := "Bertrand Russell"ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = x := "Bertrand Russell"
INFO: in while *linebuf = 23
INFO:  after read linebuf = x := "Bertrand Russell"
INFO: ch = x
INFO: scan getchr read linebuf =  := "Bertrand Russell"ch = x
INFO: cclass1 c = x
INFO: cclass c = xcctab[c] = 2
INFO: getchr linebuf =  := "Bertrand Russell"
INFO: in while *linebuf = 22
INFO:  after read linebuf =  := "Bertrand Russell"
INFO: ch =  
INFO: scan getchr read linebuf = := "Bertrand Russell"ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_id p = x
INFO: stt enter stt id = x
INFO: stt path 2
INFO: stt path 2 it = 52
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = := "Bertrand Russell"
INFO: in while *linebuf = 21
INFO:  after read linebuf = := "Bertrand Russell"
INFO: ch = :
INFO: scan getchr read linebuf = = "Bertrand Russell"ch = :
INFO: cclass1 c = :
INFO: cclass c = :cctab[c] = 5
INFO: getchr linebuf = = "Bertrand Russell"
INFO: in while *linebuf = 20
INFO:  after read linebuf = = "Bertrand Russell"
INFO: ch = =
INFO: scan getchr read linebuf =  "Bertrand Russell"ch = =
INFO: cclass1 c = =
INFO: cclass c = =cctab[c] = 5
INFO: getchr linebuf =  "Bertrand Russell"
INFO: in while *linebuf = 19
INFO:  after read linebuf =  "Bertrand Russell"
INFO: ch =  
INFO: scan getchr read linebuf = "Bertrand Russell"ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = :=
INFO: stt enter stt id = :=
INFO: stt path 2
INFO: stt path 2 it = 5
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = "Bertrand Russell"
INFO: in while *linebuf = 18
INFO:  after read linebuf = "Bertrand Russell"
INFO: ch = "
INFO: scan getchr read linebuf = Bertrand Russell"ch = "
INFO: cclass1 c = "
INFO: cclass c = "cctab[c] = 7
INFO: getchr linebuf = Bertrand Russell"
INFO: in while *linebuf = 17
INFO:  after read linebuf = Bertrand Russell"
INFO: ch = B
INFO: scan getchr read linebuf = ertrand Russell"ch = B
INFO: cclass1 c = B
INFO: cclass c = Bcctab[c] = 2
INFO: getchr linebuf = ertrand Russell"
INFO: in while *linebuf = 16
INFO:  after read linebuf = ertrand Russell"
INFO: ch = e
INFO: scan getchr read linebuf = rtrand Russell"ch = e
INFO: cclass1 c = e
INFO: cclass c = ecctab[c] = 2
INFO: getchr linebuf = rtrand Russell"
INFO: in while *linebuf = 15
INFO:  after read linebuf = rtrand Russell"
INFO: ch = r
INFO: scan getchr read linebuf = trand Russell"ch = r
INFO: cclass1 c = r
INFO: cclass c = rcctab[c] = 2
INFO: getchr linebuf = trand Russell"
INFO: in while *linebuf = 14
INFO:  after read linebuf = trand Russell"
INFO: ch = t
INFO: scan getchr read linebuf = rand Russell"ch = t
INFO: cclass1 c = t
INFO: cclass c = tcctab[c] = 2
INFO: getchr linebuf = rand Russell"
INFO: in while *linebuf = 13
INFO:  after read linebuf = rand Russell"
INFO: ch = r
INFO: scan getchr read linebuf = and Russell"ch = r
INFO: cclass1 c = r
INFO: cclass c = rcctab[c] = 2
INFO: getchr linebuf = and Russell"
INFO: in while *linebuf = 12
INFO:  after read linebuf = and Russell"
INFO: ch = a
INFO: scan getchr read linebuf = nd Russell"ch = a
INFO: cclass1 c = a
INFO: cclass c = acctab[c] = 2
INFO: getchr linebuf = nd Russell"
INFO: in while *linebuf = 11
INFO:  after read linebuf = nd Russell"
INFO: ch = n
INFO: scan getchr read linebuf = d Russell"ch = n
INFO: cclass1 c = n
INFO: cclass c = ncctab[c] = 2
INFO: getchr linebuf = d Russell"
INFO: in while *linebuf = 10
INFO:  after read linebuf = d Russell"
INFO: ch = d
INFO: scan getchr read linebuf =  Russell"ch = d
INFO: cclass1 c = d
INFO: cclass c = dcctab[c] = 2
INFO: getchr linebuf =  Russell"
INFO: in while *linebuf = 9
INFO:  after read linebuf =  Russell"
INFO: ch =  
INFO: scan getchr read linebuf = Russell"ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = Russell"
INFO: in while *linebuf = 8
INFO:  after read linebuf = Russell"
INFO: ch = R
INFO: scan getchr read linebuf = ussell"ch = R
INFO: cclass1 c = R
INFO: cclass c = Rcctab[c] = 2
INFO: getchr linebuf = ussell"
INFO: in while *linebuf = 7
INFO:  after read linebuf = ussell"
INFO: ch = u
INFO: scan getchr read linebuf = ssell"ch = u
INFO: cclass1 c = u
INFO: cclass c = ucctab[c] = 2
INFO: getchr linebuf = ssell"
INFO: in while *linebuf = 6
INFO:  after read linebuf = ssell"
INFO: ch = s
INFO: scan getchr read linebuf = sell"ch = s
INFO: cclass1 c = s
INFO: cclass c = scctab[c] = 2
INFO: getchr linebuf = sell"
INFO: in while *linebuf = 5
INFO:  after read linebuf = sell"
INFO: ch = s
INFO: scan getchr read linebuf = ell"ch = s
INFO: cclass1 c = s
INFO: cclass c = scctab[c] = 2
INFO: getchr linebuf = ell"
INFO: in while *linebuf = 4
INFO:  after read linebuf = ell"
INFO: ch = e
INFO: scan getchr read linebuf = ll"ch = e
INFO: cclass1 c = e
INFO: cclass c = ecctab[c] = 2
INFO: getchr linebuf = ll"
INFO: in while *linebuf = 3
INFO:  after read linebuf = ll"
INFO: ch = l
INFO: scan getchr read linebuf = l"ch = l
INFO: cclass1 c = l
INFO: cclass c = lcctab[c] = 2
INFO: getchr linebuf = l"
INFO: in while *linebuf = 2
INFO:  after read linebuf = l"
INFO: ch = l
INFO: scan getchr read linebuf = "ch = l
INFO: cclass1 c = l
INFO: cclass c = lcctab[c] = 2
INFO: getchr linebuf = "
INFO: in while *linebuf = 1
INFO:  after read linebuf = "
INFO: ch = "
INFO: scan getchr read linebuf = ch = "
INFO: cclass1 c = "
INFO: cclass c = "cctab[c] = 7
INFO: getchr linebuf = 
INFO: in while *linebuf = 40
INFO:  after read linebuf =  x := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = x := 1872 - 5 * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 146
INFO: mknode va_alist
mkode return                    33      QStrNode__state
mkode return                    33      QStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = x := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 39
INFO:  after read linebuf = x := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = x
INFO: scan getchr read linebuf =  := 1872 - 5 * 18 / 6 + 4 + x - 6 / x ch = x
INFO: cclass1 c = x
INFO: cclass c = xcctab[c] = 2
INFO: getchr linebuf =  := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 38
INFO:  after read linebuf =  := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = := 1872 - 5 * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_id p = x
INFO: stt enter stt id = x
INFO: stt path 2
INFO: stt path 2 it = 52
INFO: Parser: action = 55
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 37
INFO:  after read linebuf = := 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = :
INFO: scan getchr read linebuf = = 1872 - 5 * 18 / 6 + 4 + x - 6 / x ch = :
INFO: cclass1 c = :
INFO: cclass c = :cctab[c] = 5
INFO: getchr linebuf = = 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 36
INFO:  after read linebuf = = 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = =
INFO: scan getchr read linebuf =  1872 - 5 * 18 / 6 + 4 + x - 6 / x ch = =
INFO: cclass1 c = =
INFO: cclass c = =cctab[c] = 5
INFO: getchr linebuf =  1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 35
INFO:  after read linebuf =  1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 1872 - 5 * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = :=
INFO: stt enter stt id = :=
INFO: stt path 2
INFO: stt path 2 it = 5
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 34
INFO:  after read linebuf = 1872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = 1
INFO: scan getchr read linebuf = 872 - 5 * 18 / 6 + 4 + x - 6 / x ch = 1
INFO: cclass1 c = 1
INFO: cclass c = 1cctab[c] = 3
INFO: getchr linebuf = 872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 33
INFO:  after read linebuf = 872 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = 8
INFO: scan getchr read linebuf = 72 - 5 * 18 / 6 + 4 + x - 6 / x ch = 8
INFO: cclass1 c = 8
INFO: cclass c = 8cctab[c] = 3
INFO: getchr linebuf = 72 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 32
INFO:  after read linebuf = 72 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = 7
INFO: scan getchr read linebuf = 2 - 5 * 18 / 6 + 4 + x - 6 / x ch = 7
INFO: cclass1 c = 7
INFO: cclass c = 7cctab[c] = 3
INFO: getchr linebuf = 2 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 31
INFO:  after read linebuf = 2 - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = 2
INFO: scan getchr read linebuf =  - 5 * 18 / 6 + 4 + x - 6 / x ch = 2
INFO: cclass1 c = 2
INFO: cclass c = 2cctab[c] = 3
INFO: getchr linebuf =  - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 30
INFO:  after read linebuf =  - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = - 5 * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 29
INFO:  after read linebuf = - 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = -
INFO: scan getchr read linebuf =  5 * 18 / 6 + 4 + x - 6 / x ch = -
INFO: cclass1 c = -
INFO: cclass c = -cctab[c] = 5
INFO: getchr linebuf =  5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 28
INFO:  after read linebuf =  5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 5 * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = -
INFO: stt enter stt id = -
INFO: stt path 2
INFO: stt path 2 it = 15
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 5 * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 27
INFO:  after read linebuf = 5 * 18 / 6 + 4 + x - 6 / x 
INFO: ch = 5
INFO: scan getchr read linebuf =  * 18 / 6 + 4 + x - 6 / x ch = 5
INFO: cclass1 c = 5
INFO: cclass c = 5cctab[c] = 3
INFO: getchr linebuf =  * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 26
INFO:  after read linebuf =  * 18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = * 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = * 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 25
INFO:  after read linebuf = * 18 / 6 + 4 + x - 6 / x 
INFO: ch = *
INFO: scan getchr read linebuf =  18 / 6 + 4 + x - 6 / x ch = *
INFO: cclass1 c = *
INFO: cclass c = *cctab[c] = 5
INFO: getchr linebuf =  18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 24
INFO:  after read linebuf =  18 / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 18 / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = *
INFO: stt enter stt id = *
INFO: stt path 2
INFO: stt path 2 it = 16
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 18 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 23
INFO:  after read linebuf = 18 / 6 + 4 + x - 6 / x 
INFO: ch = 1
INFO: scan getchr read linebuf = 8 / 6 + 4 + x - 6 / x ch = 1
INFO: cclass1 c = 1
INFO: cclass c = 1cctab[c] = 3
INFO: getchr linebuf = 8 / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 22
INFO:  after read linebuf = 8 / 6 + 4 + x - 6 / x 
INFO: ch = 8
INFO: scan getchr read linebuf =  / 6 + 4 + x - 6 / x ch = 8
INFO: cclass1 c = 8
INFO: cclass c = 8cctab[c] = 3
INFO: getchr linebuf =  / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 21
INFO:  after read linebuf =  / 6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = / 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = / 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 20
INFO:  after read linebuf = / 6 + 4 + x - 6 / x 
INFO: ch = /
INFO: scan getchr read linebuf =  6 + 4 + x - 6 / x ch = /
INFO: cclass1 c = /
INFO: cclass c = /cctab[c] = 5
INFO: getchr linebuf =  6 + 4 + x - 6 / x 
INFO: in while *linebuf = 19
INFO:  after read linebuf =  6 + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 6 + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = /
INFO: stt enter stt id = /
INFO: stt path 2
INFO: stt path 2 it = 17
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 6 + 4 + x - 6 / x 
INFO: in while *linebuf = 18
INFO:  after read linebuf = 6 + 4 + x - 6 / x 
INFO: ch = 6
INFO: scan getchr read linebuf =  + 4 + x - 6 / x ch = 6
INFO: cclass1 c = 6
INFO: cclass c = 6cctab[c] = 3
INFO: getchr linebuf =  + 4 + x - 6 / x 
INFO: in while *linebuf = 17
INFO:  after read linebuf =  + 4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = + 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = + 4 + x - 6 / x 
INFO: in while *linebuf = 16
INFO:  after read linebuf = + 4 + x - 6 / x 
INFO: ch = +
INFO: scan getchr read linebuf =  4 + x - 6 / x ch = +
INFO: cclass1 c = +
INFO: cclass c = +cctab[c] = 5
INFO: getchr linebuf =  4 + x - 6 / x 
INFO: in while *linebuf = 15
INFO:  after read linebuf =  4 + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 4 + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = +
INFO: stt enter stt id = +
INFO: stt path 2
INFO: stt path 2 it = 14
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 4 + x - 6 / x 
INFO: in while *linebuf = 14
INFO:  after read linebuf = 4 + x - 6 / x 
INFO: ch = 4
INFO: scan getchr read linebuf =  + x - 6 / x ch = 4
INFO: cclass1 c = 4
INFO: cclass c = 4cctab[c] = 3
INFO: getchr linebuf =  + x - 6 / x 
INFO: in while *linebuf = 13
INFO:  after read linebuf =  + x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = + x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = + x - 6 / x 
INFO: in while *linebuf = 12
INFO:  after read linebuf = + x - 6 / x 
INFO: ch = +
INFO: scan getchr read linebuf =  x - 6 / x ch = +
INFO: cclass1 c = +
INFO: cclass c = +cctab[c] = 5
INFO: getchr linebuf =  x - 6 / x 
INFO: in while *linebuf = 11
INFO:  after read linebuf =  x - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = x - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = +
INFO: stt enter stt id = +
INFO: stt path 2
INFO: stt path 2 it = 14
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = x - 6 / x 
INFO: in while *linebuf = 10
INFO:  after read linebuf = x - 6 / x 
INFO: ch = x
INFO: scan getchr read linebuf =  - 6 / x ch = x
INFO: cclass1 c = x
INFO: cclass c = xcctab[c] = 2
INFO: getchr linebuf =  - 6 / x 
INFO: in while *linebuf = 9
INFO:  after read linebuf =  - 6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = - 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_id p = x
INFO: stt enter stt id = x
INFO: stt path 2
INFO: stt path 2 it = 52
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = - 6 / x 
INFO: in while *linebuf = 8
INFO:  after read linebuf = - 6 / x 
INFO: ch = -
INFO: scan getchr read linebuf =  6 / x ch = -
INFO: cclass1 c = -
INFO: cclass c = -cctab[c] = 5
INFO: getchr linebuf =  6 / x 
INFO: in while *linebuf = 7
INFO:  after read linebuf =  6 / x 
INFO: ch =  
INFO: scan getchr read linebuf = 6 / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = -
INFO: stt enter stt id = -
INFO: stt path 2
INFO: stt path 2 it = 15
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 6 / x 
INFO: in while *linebuf = 6
INFO:  after read linebuf = 6 / x 
INFO: ch = 6
INFO: scan getchr read linebuf =  / x ch = 6
INFO: cclass1 c = 6
INFO: cclass c = 6cctab[c] = 3
INFO: getchr linebuf =  / x 
INFO: in while *linebuf = 5
INFO:  after read linebuf =  / x 
INFO: ch =  
INFO: scan getchr read linebuf = / x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 147
INFO: mknode va_alist
mkode return                    34      UQStrNode__state
mkode return                    34      UQStrNode__state
INFO: Parser: action = 82
INFO: Parser: action = 58
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = / x 
INFO: in while *linebuf = 4
INFO:  after read linebuf = / x 
INFO: ch = /
INFO: scan getchr read linebuf =  x ch = /
INFO: cclass1 c = /
INFO: cclass c = /cctab[c] = 5
INFO: getchr linebuf =  x 
INFO: in while *linebuf = 3
INFO:  after read linebuf =  x 
INFO: ch =  
INFO: scan getchr read linebuf = x ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_op p = /
INFO: stt enter stt id = /
INFO: stt path 2
INFO: stt path 2 it = 17
INFO: Parser: action = 55
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 145
INFO: mknode va_alist
mkode return                    31      OpridNode__state
mkode return                    31      OpridNode__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = x 
INFO: in while *linebuf = 2
INFO:  after read linebuf = x 
INFO: ch = x
INFO: scan getchr read linebuf =  ch = x
INFO: cclass1 c = x
INFO: cclass c = xcctab[c] = 2
INFO: getchr linebuf =  
INFO: in while *linebuf = 1
INFO:  after read linebuf =  
INFO: ch =  
INFO: scan getchr read linebuf = ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: reschk_id p = x
INFO: stt enter stt id = x
INFO: stt path 2
INFO: stt path 2 it = 52
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright dump_info(e) = OpridNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 144
INFO: mknode va_alist
mkode return                    32      LetterId__state
mkode return                    32      LetterId__state
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 
INFO: in while *linebuf = 1
INFO:  after read linebuf =  
INFO: ch =  
INFO: scan getchr read linebuf = ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 
INFO: in while *linebuf = 1
INFO:  after read linebuf =  
INFO: ch =  
INFO: scan getchr read linebuf = ch =  
INFO: cclass1 c =  
INFO: cclass c =  cctab[c] = 1
INFO: getchr linebuf = 
INFO: cclass1 c = -1
INFO: cclass EOFCC
INFO: Parser: action = 134
INFO: Parser: action = 81
INFO: Parser: action = 58
INFO: Parser: action = 55
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last.cn_tl_field should equal p above
addright - in next node lh last should equal p above
addright - in next node lh last should equal p above
addright return
addright return
INFO: Parser: action = 51
IN LENGTH
IN LENGTH
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 0dump_info(self.lh_first) = ConsNode__state
length count = 1dump_info(v) = LetterId__state
length count = 1dump_info(v) = LetterId__state
length count = 2dump_info(v) = OpridNode__state
length count = 2dump_info(v) = OpridNode__state
length count = 3dump_info(v) = LetterId__state
length count = 3dump_info(v) = LetterId__state
length count = 4dump_info(v) = LetterId__state
length count = 4dump_info(v) = LetterId__state
length count = 5dump_info(v) = OpridNode__state
length count = 5dump_info(v) = OpridNode__state
length count = 6dump_info(v) = QStrNode__state
length count = 6dump_info(v) = QStrNode__state
length count = 7dump_info(v) = LetterId__state
length count = 7dump_info(v) = LetterId__state
length count = 8dump_info(v) = OpridNode__state
length count = 8dump_info(v) = OpridNode__state
length count = 9dump_info(v) = UQStrNode__state
length count = 9dump_info(v) = UQStrNode__state
length count = 10dump_info(v) = OpridNode__state
length count = 10dump_info(v) = OpridNode__state
length count = 11dump_info(v) = UQStrNode__state
length count = 11dump_info(v) = UQStrNode__state
length count = 12dump_info(v) = OpridNode__state
length count = 12dump_info(v) = OpridNode__state
length count = 13dump_info(v) = UQStrNode__state
length count = 13dump_info(v) = UQStrNode__state
length count = 14dump_info(v) = OpridNode__state
length count = 14dump_info(v) = OpridNode__state
length count = 15dump_info(v) = UQStrNode__state
length count = 15dump_info(v) = UQStrNode__state
length count = 16dump_info(v) = OpridNode__state
length count = 16dump_info(v) = OpridNode__state
length count = 17dump_info(v) = UQStrNode__state
length count = 17dump_info(v) = UQStrNode__state
length count = 18dump_info(v) = OpridNode__state
length count = 18dump_info(v) = OpridNode__state
length count = 19dump_info(v) = LetterId__state
length count = 19dump_info(v) = LetterId__state
length count = 20dump_info(v) = OpridNode__state
length count = 20dump_info(v) = OpridNode__state
length count = 21dump_info(v) = UQStrNode__state
length count = 21dump_info(v) = UQStrNode__state
length count = 22dump_info(v) = OpridNode__state
length count = 22dump_info(v) = OpridNode__state
length count = 23dump_info(v) = LetterId__state
length count = 23dump_info(v) = LetterId__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list_to_array count = 0dump_info(self.lh_first) = ConsNode__state
list to array len = 23 tmp = ConsNode__state
list to array len = 23 tmp = ConsNode__state
list to array count = 1 v = LetterId__state
list to array count = 1 v = LetterId__state
list to array count = 2 v = OpridNode__state
list to array count = 2 v = OpridNode__state
list to array count = 3 v = LetterId__state
list to array count = 3 v = LetterId__state
list to array count = 4 v = LetterId__state
list to array count = 4 v = LetterId__state
list to array count = 5 v = OpridNode__state
list to array count = 5 v = OpridNode__state
list to array count = 6 v = QStrNode__state
list to array count = 6 v = QStrNode__state
list to array count = 7 v = LetterId__state
list to array count = 7 v = LetterId__state
list to array count = 8 v = OpridNode__state
list to array count = 8 v = OpridNode__state
list to array count = 9 v = UQStrNode__state
list to array count = 9 v = UQStrNode__state
list to array count = 10 v = OpridNode__state
list to array count = 10 v = OpridNode__state
list to array count = 11 v = UQStrNode__state
list to array count = 11 v = UQStrNode__state
list to array count = 12 v = OpridNode__state
list to array count = 12 v = OpridNode__state
list to array count = 13 v = UQStrNode__state
list to array count = 13 v = UQStrNode__state
list to array count = 14 v = OpridNode__state
list to array count = 14 v = OpridNode__state
list to array count = 15 v = UQStrNode__state
list to array count = 15 v = UQStrNode__state
list to array count = 16 v = OpridNode__state
list to array count = 16 v = OpridNode__state
list to array count = 17 v = UQStrNode__state
list to array count = 17 v = UQStrNode__state
list to array count = 18 v = OpridNode__state
list to array count = 18 v = OpridNode__state
list to array count = 19 v = LetterId__state
list to array count = 19 v = LetterId__state
list to array count = 20 v = OpridNode__state
list to array count = 20 v = OpridNode__state
list to array count = 21 v = UQStrNode__state
list to array count = 21 v = UQStrNode__state
list to array count = 22 v = OpridNode__state
list to array count = 22 v = OpridNode__state
list to array count = 23 v = LetterId__state
list to array count = 23 v = LetterId__state
INFO: mkappl size = 23
INFO: type body i = 1LetterId__state
INFO: type body i = 2OpridNode__state
INFO: type body i = 3LetterId__state
INFO: type body i = 4LetterId__state
INFO: type body i = 5OpridNode__state
INFO: type body i = 6QStrNode__state
INFO: type body i = 7LetterId__state
INFO: type body i = 8OpridNode__state
INFO: type body i = 9UQStrNode__state
INFO: type body i = 10OpridNode__state
INFO: type body i = 11UQStrNode__state
INFO: type body i = 12OpridNode__state
INFO: type body i = 13UQStrNode__state
INFO: type body i = 14OpridNode__state
INFO: type body i = 15UQStrNode__state
INFO: type body i = 16OpridNode__state
INFO: type body i = 17UQStrNode__state
INFO: type body i = 18OpridNode__state
INFO: type body i = 19LetterId__state
INFO: type body i = 20OpridNode__state
INFO: type body i = 21UQStrNode__state
INFO: type body i = 22OpridNode__state
INFO: type body i = 23LetterId__state
INFO: mkappl2 head = 1 tail = 23
INFO: outermost_op p = 1 head = 1 tail = 23
INFO: array = list
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 2 tail = 23
INFO: outermost_op p = 2 head = 2 tail = 23
INFO: array = list
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = OpridNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 3 tail = 23
INFO: outermost_op p = 3 head = 3 tail = 23
INFO: array = list
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 4 tail = 23
INFO: outermost_op p = 4 head = 4 tail = 23
INFO: array = list
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 5 tail = 23
INFO: outermost_op p = 5 head = 5 tail = 23
INFO: array = list
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = OpridNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 6 tail = 23
INFO: outermost_op p = 6 head = 6 tail = 23
INFO: array = list
INFO: type(array(p) = QStrNode__state
INFO: precedence p = QStrNode__state
INFO: i = 15
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = QStrNode__state
INFO: precedence p = LetterId__state
INFO: mkappl2 head = 6 tail = 6
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = QStrNode__state
mklist type p = QStrNode__state
INFO: mklist type p = QStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright dump_info(e) = QStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 8 tail = 23
INFO: outermost_op p = 8 head = 8 tail = 23
INFO: array = list
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = OpridNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 9 tail = 23
INFO: outermost_op p = 9 head = 9 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 9 tail = 9
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 11 tail = 23
INFO: outermost_op p = 11 head = 11 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 11 tail = 11
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 13 tail = 23
INFO: outermost_op p = 13 head = 13 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 13 tail = 13
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 15 tail = 23
INFO: outermost_op p = 15 head = 15 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 15 tail = 15
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 17 tail = 23
INFO: outermost_op p = 17 head = 17 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 17 tail = 17
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 19 tail = 23
INFO: outermost_op p = 19 head = 19 tail = 23
INFO: array = list
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = LetterId__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 20 tail = 23
INFO: outermost_op p = 20 head = 20 tail = 23
INFO: array = list
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = OpridNode__state
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
INFO: mkappl2 head = 21 tail = 23
INFO: outermost_op p = 21 head = 21 tail = 23
INFO: array = list
INFO: type(array(p) = UQStrNode__state
INFO: precedence p = UQStrNode__state
INFO: i = 15
INFO: type(array(p) = OpridNode__state
INFO: precedence p = OpridNode__state
INFO: i = 0
INFO: type(array(p) = LetterId__state
INFO: precedence p = LetterId__state
INFO: i = 0
INFO: lower_prec = 0
INFO: ASSGNLEVEL
INFO: precedence p = UQStrNode__state
INFO: precedence p = OpridNode__state
INFO: mkappl2 head = 21 tail = 21
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = UQStrNode__state
mklist type p = UQStrNode__state
INFO: mklist type p = UQStrNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright dump_info(e) = UQStrNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
INFO: mkappl2 head = 23 tail = 23
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = LetterId__state
mklist type p = LetterId__state
INFO: mklist type p = LetterId__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright dump_info(e) = LetterId__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
INFO: mknode va_alist
mkode return                    13      ApplicationNode__state
mkode return                    13      ApplicationNode__state
INFO: mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
mklist va_alist
Creating emptylist
Creating emptylist
Creating emptylist
Creating emptylist
INFO: mknode va_alist
mkode return                    0       ListHeaderNode__state
mkode return                    0       ListHeaderNode__state
mklist type p = ApplicationNode__state
mklist type p = ApplicationNode__state
INFO: mklist type p = ApplicationNode__state
mklist l before addright(l,p)
mklist l before addright(l,p)
mklist p before addright(l,p)
mklist p before addright(l,p)
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright dump_info(e) = ApplicationNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
addright 2 p = ConsNode__state
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
is empty l.lh_first TRUE
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright 3 l = emptyListHeaderNode__state
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright - in next node lh first & last should equal p above
addright return
addright return
mklist l after addright(l,p)
mklist l after addright(l,p)
mklist done
mklist done
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
is empty lh_first - FALSE
INFO: Parser: action = 50
INFO: Parser: action = 2
INFO: Parse: begin action (A) 2stxree = null
INFO: Parse: begin part B 2 stxree = null
INFO: Parser: Program accepted!!!!
INFO: *** End of Russell parse
Symbol              Index               Association
INFO: Building symbol table
INFO: main stxtree = ConsNode__state
INFO: Top build symtab
kind   =            13
vlineno   =         1
pre_num   =         null
post_num   =        null
cn_hd_field   =     null
cn_tl_field   =     null
Unique Id   =       162
signature   =       LetterId__state
sig_done   =        ListHeaderNode__state
ap_operator   =     null
ap_args   =         null
ap_void_decl   =    null
INFO: Top build symtab
