./main.tmp.rb:# extern NODE * stxtree;
./main.tmp.rb:  build_symtab( $stxtree )
./main.tmp.rb:  fixup($stxtree)
./main.tmp.rb:  #   prtree(stxtree)
./main.tmp.rb:  tl_checksigs($stxtree)
./main.tmp.rb:  #   prtree(stxtree)
./main.tmp.rb:#        gGgeneratepcode( $ofile, $stxtree,
./main.tmp.rb:        gGgeneratepcode( $ofile, $stxtree,
./main.tmp.rb:#        vVgeneratepcode( $ofile, $stxtree,
./main.tmp.rb:        vVgeneratepcode( $ofile, $stxtree,
./main.tmp.rb:      gGgenerateXcode( $ofile, $stxtree,
./main.tmp.rb:      gGgeneratecode( $ofile, $stxtree )
./main.tmp.rb:      vVgeneratecode( $ofile, $stxtree )
Binary file ./PRc matches
./#main.tmp.rb#:# extern NODE * stxtree;
./#main.tmp.rb#:# build_symtab( stxtree )
./#main.tmp.rb#:# fixup (stxtree);
./#main.tmp.rb#:#   prtree(stxtree)
./#main.tmp.rb#:# tl_checksigs(stxtree)
./#main.tmp.rb#:#   prtree(stxtree)
./#main.tmp.rb#:# 		      Ggeneratepcode( ofile, stxtree,
./#main.tmp.rb#:# 		      Vgeneratepcode( ofile, stxtree,
./#main.tmp.rb#:# 		      GgenerateXcode( ofile, stxtree,
./#main.tmp.rb#:# 		      Ggeneratecode( ofile, stxtree );
./#main.tmp.rb#:# 		      Vgeneratecode( ofile, stxtree );
./main.save.rb:# extern NODE * stxtree;
./main.save.rb:# build_symtab( stxtree )
./main.save.rb:# fixup (stxtree);
./main.save.rb:#   prtree(stxtree)
./main.save.rb:# tl_checksigs(stxtree)
./main.save.rb:#   prtree(stxtree)
./main.save.rb:# 		      Ggeneratepcode( ofile, stxtree,
./main.save.rb:# 		      Vgeneratepcode( ofile, stxtree,
./main.save.rb:# 		      GgenerateXcode( ofile, stxtree,
./main.save.rb:# 		      Ggeneratecode( ofile, stxtree );
./main.save.rb:# 		      Vgeneratecode( ofile, stxtree );
./main.c:extern NODE * stxtree;
./main.c:	build_symtab( stxtree );
./main.c:	fixup (stxtree);
./main.c:	prtree(stxtree);
./main.c:	tl_checksigs(stxtree);
./main.c:	prtree(stxtree);
./main.c:		      Ggeneratepcode( ofile, stxtree,
./main.c:		      Vgeneratepcode( ofile, stxtree,
./main.c:		      GgenerateXcode( ofile, stxtree,
./main.c:		      Ggeneratecode( ofile, stxtree );
./main.c:		      Vgeneratecode( ofile, stxtree );
./main.tmp.save2.rb:# extern NODE * stxtree;
./main.tmp.save2.rb:# build_symtab( stxtree )
./main.tmp.save2.rb:# fixup (stxtree);
./main.tmp.save2.rb:#   prtree(stxtree)
./main.tmp.save2.rb:# tl_checksigs(stxtree)
./main.tmp.save2.rb:#   prtree(stxtree)
./main.tmp.save2.rb:# 		      Ggeneratepcode( ofile, stxtree,
./main.tmp.save2.rb:# 		      Vgeneratepcode( ofile, stxtree,
./main.tmp.save2.rb:# 		      GgenerateXcode( ofile, stxtree,
./main.tmp.save2.rb:# 		      Ggeneratecode( ofile, stxtree );
./main.tmp.save2.rb:# 		      Vgeneratecode( ofile, stxtree );
./main.rb:# extern NODE * stxtree;
./main.rb:  build_symtab( $stxtree )
./main.rb:  fixup($stxtree)
./main.rb:  #   prtree(stxtree)
./main.rb:  tl_checksigs($stxtree)
./main.rb:  #   prtree(stxtree)
./main.rb:#        gGgeneratepcode( $ofile, $stxtree,
./main.rb:        gGgeneratepcode( $ofile, $stxtree,
./main.rb:#        vVgeneratepcode( $ofile, $stxtree,
./main.rb:        vVgeneratepcode( $ofile, $stxtree,
./main.rb:      gGgenerateXcode( $ofile, $stxtree,
./main.rb:      gGgeneratecode( $ofile, $stxtree )
./main.rb:      vVgeneratecode( $ofile, $stxtree )
./main.save2.rb:# extern NODE * stxtree;
./main.save2.rb:# build_symtab( stxtree )
./main.save2.rb:# fixup (stxtree);
./main.save2.rb:#   prtree(stxtree)
./main.save2.rb:# tl_checksigs(stxtree)
./main.save2.rb:#   prtree(stxtree)
./main.save2.rb:# 		      Ggeneratepcode( ofile, stxtree,
./main.save2.rb:# 		      Vgeneratepcode( ofile, stxtree,
./main.save2.rb:# 		      GgenerateXcode( ofile, stxtree,
./main.save2.rb:# 		      Ggeneratecode( ofile, stxtree );
./main.save2.rb:# 		      Vgeneratecode( ofile, stxtree );
Binary file ./Rc matches
./main.rb~:# extern NODE * stxtree;
./main.rb~:  build_symtab( $stxtree )
./main.rb~:  fixup($stxtree)
./main.rb~:  #   prtree(stxtree)
./main.rb~:  tl_checksigs($stxtree)
./main.rb~:  #   prtree(stxtree)
./main.rb~:#        gGgeneratepcode( $ofile, $stxtree,
./main.rb~:        gGgeneratepcode( $ofile, $stxtree,
./main.rb~:#        vVgeneratepcode( $ofile, $stxtree,
./main.rb~:        vVgeneratepcode( $ofile, $stxtree,
./main.rb~:      gGgenerateXcode( $ofile, $stxtree,
./main.rb~:      gGgeneratecode( $ofile, $stxtree )
./main.rb~:      vVgeneratecode( $ofile, $stxtree )
./main.tmp.save.rb:# extern NODE * stxtree;
./main.tmp.save.rb:# build_symtab( stxtree )
./main.tmp.save.rb:# fixup (stxtree);
./main.tmp.save.rb:#   prtree(stxtree)
./main.tmp.save.rb:# tl_checksigs(stxtree)
./main.tmp.save.rb:#   prtree(stxtree)
./main.tmp.save.rb:# 		      Ggeneratepcode( ofile, stxtree,
./main.tmp.save.rb:# 		      Vgeneratepcode( ofile, stxtree,
./main.tmp.save.rb:# 		      GgenerateXcode( ofile, stxtree,
./main.tmp.save.rb:# 		      Ggeneratecode( ofile, stxtree );
./main.tmp.save.rb:# 		      Vgeneratecode( ofile, stxtree );
./pass1/parser/y.tab.well_001.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.well_001.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_001.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/y.tab.well_001.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_001.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/y.tab.rb~:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.rb~:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.rb~:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/y.tab.rb~:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.rb~:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/#grammar.y#:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/#grammar.y#:        { if (stxtree != NIL) {
./pass1/parser/#grammar.y#:	    stxtree = lock($2);
./pass1/parser/y.tab.c:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/y.tab.c:    { if (stxtree != NIL) {
./pass1/parser/y.tab.c:	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/y.tab.well_002.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.well_002.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_002.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/y.tab.well_002.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_002.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/t.tab.beforegoto_part2.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/t.tab.beforegoto_part2.rb:#     { if (stxtree != NIL) {
./pass1/parser/t.tab.beforegoto_part2.rb:# 	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/y.tab.before_2nd_redo_stack.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.before_2nd_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.before_2nd_redo_stack.rb:      stxtree = lock(djd_peek_vsa(0))
./pass1/parser/y.tab.before_2nd_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.before_2nd_redo_stack.rb:      stxtree = lock(djd_peek_vsa(0))
./pass1/parser/#y.tab.c#:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/#y.tab.c#:    { if (stxtree != NIL) {
./pass1/parser/#y.tab.c#:	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/djd:./y.tab.well_001.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.well_001.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_001.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./y.tab.well_001.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_001.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./y.tab.rb~:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.rb~:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.rb~:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./y.tab.rb~:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.rb~:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./#grammar.y#:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/djd:./#grammar.y#:        { if (stxtree != NIL) {
./pass1/parser/djd:./#grammar.y#:	    stxtree = lock($2);
./pass1/parser/djd:./y.tab.c:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.c:    { if (stxtree != NIL) {
./pass1/parser/djd:./y.tab.c:	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/djd:./y.tab.well_002.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.well_002.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_002.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./y.tab.well_002.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_002.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./t.tab.beforegoto_part2.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./t.tab.beforegoto_part2.rb:#     { if (stxtree != NIL) {
./pass1/parser/djd:./t.tab.beforegoto_part2.rb:# 	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/djd:./y.tab.before_2nd_redo_stack.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.before_2nd_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.before_2nd_redo_stack.rb:      stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./y.tab.before_2nd_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.before_2nd_redo_stack.rb:      stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./#y.tab.c#:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/djd:./#y.tab.c#:    { if (stxtree != NIL) {
./pass1/parser/djd:./#y.tab.c#:	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/djd:./grammar.y:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/djd:./grammar.y:        { if (stxtree != NIL) {
./pass1/parser/djd:./grammar.y:	    stxtree = lock($2);
./pass1/parser/djd:./t.tab.beforegoto.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./t.tab.beforegoto.rb:#     { if (stxtree != NIL) {
./pass1/parser/djd:./t.tab.beforegoto.rb:# 	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/djd:./y.tab.tmp.rb:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.tmp.rb:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.tmp.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./y.tab.tmp.rb:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.tmp.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./y.tab.before_redo_stack.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.before_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.before_redo_stack.rb:      stxtree = lock((yyvsp[(2) - (2)]))
./pass1/parser/djd:./y.tab.before_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.before_redo_stack.rb:      stxtree = lock((yyvsp[(2) - (2)]))
./pass1/parser/djd:./y.tab.well_003.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.well_003.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_003.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./y.tab.well_003.rb:    if (stxtree != NIL) then
./pass1/parser/djd:./y.tab.well_003.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/djd:./y.tab.rb:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/djd:./y.tab.rb:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/djd:./y.tab.rb:    if ($stxtree != RNIL) then
./pass1/parser/djd:./y.tab.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/grammar.y:    NODE * stxtree = NIL; /* pointer to root of syntax tree */
./pass1/parser/grammar.y:        { if (stxtree != NIL) {
./pass1/parser/grammar.y:	    stxtree = lock($2);
./pass1/parser/t.tab.beforegoto.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/t.tab.beforegoto.rb:#     { if (stxtree != NIL) {
./pass1/parser/t.tab.beforegoto.rb:# 	    stxtree = lock((yyvsp[(2) - (2)]));
./pass1/parser/y.tab.tmp.rb:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.tmp.rb:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.tmp.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/y.tab.tmp.rb:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.tmp.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/y.tab.before_redo_stack.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.before_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.before_redo_stack.rb:      stxtree = lock((yyvsp[(2) - (2)]))
./pass1/parser/y.tab.before_redo_stack.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.before_redo_stack.rb:      stxtree = lock((yyvsp[(2) - (2)]))
./pass1/parser/y.tab.well_003.rb:    stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.well_003.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_003.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/y.tab.well_003.rb:    if (stxtree != NIL) then
./pass1/parser/y.tab.well_003.rb:      stxtree = lock(djd_peep_vsa(0))
./pass1/parser/y.tab.rb:    $stxtree = RNIL; # /* pointer to root of syntax tree */
./pass1/parser/y.tab.rb:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.rb:      $stxtree = lock(djd_peek_vsa(0))
./pass1/parser/y.tab.rb:    if ($stxtree != RNIL) then
./pass1/parser/y.tab.rb:      $stxtree = lock(djd_peek_vsa(0))
Binary file ./pass1/pass1.o matches
