Update README to display better in markdown

Use <stdarg.h> to pass arguments correctly, as ack/util/util.c
already uses <stdarg.h> the same way.

.distr

@@ -1,19 +1,57 @@
-Action
-Copyright
-NEW
 README
-TakeAction
-bin
-doc
-emtest
-etc
-first
+CHANGES
+Copyright
+pm
+pmfile
+config.pm
+
 h
-include
-modules
-lang
-lib
-mach
-man
-mkun
-util
+modules/h
+
+first
+util/data
+util/LLgen
+
+modules/src/alloc
+modules/src/assert
+modules/src/system
+modules/src/string
+modules/src/read_em
+modules/src/em_code
+modules/src/em_mes
+modules/src/print
+modules/src/object
+modules/src/idf
+modules/src/input
+modules/src/flt_arith
+
+util/amisc
+util/cmisc
+util/ack
+lib/descr/fe
+util/arch
+#util/cpp
+util/cgg
+util/ncgg
+util/misc
+util/opt
+util/ego
+util/topgen
+util/led
+
+lang/cem
+lang/pc
+lang/m2
+#lang/occam
+#lang/basic
+
+mach/proto
+mach/i80
+mach/i86
+mach/i386
+
+plat/cpm
+plat/pc86
+plat/linux386
+
+examples

.gitignore

@@ -0,0 +1,4 @@
+*~
+*.o
+.*
+-.gitignore

.hgtags

@@ -0,0 +1,9 @@
+5a0daa6017c4aa5ae23b870e97eb7431021762bc distr2
+15b742c4c278c27029eca0e41f16463bc076de6e distr3
+a0686e2ca8d6780ce37b8267b865f60e9317a340 llgen-1-0
+d96cd06672c368e8aaa584fead379ce1d343acad oct-1
+bf69b3579e8545ecfc03f5e2550586e3c479270d release-6-0-pre-4
+e880082b57f12a7df1c33a2da2c7424d6368f185 dist2
+fe535e3e8bc859d4a4e4a186f42670f9e588a5aa release-5-6
+90102c21c4480102634c6a482d0dd55f2d9ca00f release-6-0-pre-3
+ddc0de0e5e7d91b1dcd7c05602c9c2a6adf8d312 release-6-0-pre-1

Action

@@ -1,28 +1,45 @@
 name	"System definition"
 dir first
-action did_first
-failure "You have to run the shell script first in the directory first"
+action ack_sys
+failure "You have to run the shell script first/first"
 fatal
 end
-name	"EM definition"
-dir etc
-end
-name "LL(1) Parser generator"
-dir util/LLgen
+name "Manual pages"
+dir man
 end
+! name	"EM definition"
+! dir etc
+! end
 name "EM definition library"
 dir util/data
 end
 name "C utilities"
 dir util/cmisc
 end
+name "Yacc parser generator"
+dir util/byacc
+end
+name "Flex lexical analyzer generator"
+dir util/flex
+action "make firstinstall && make clean"
+end
+name "Include files for modules"
+dir modules/h
+end
 name "Modules"
 dir modules/src
 indir
 end
+! name "LL(1) Parser generator"
+! dir util/LLgen
+! action "make firstinstall && make clean"
+! end
 name "C preprocessor"
 dir util/cpp
 end
+name "Peephole optimizer libraries"
+dir modules/src/em_opt
+end
 name "ACK object utilities"
 dir util/amisc
 end
@@ -54,6 +71,10 @@ end
 name "Bootstrap for newest form of backend tables"
 dir util/ncgg
 end
+name "Bootstrap for code expanders"
+dir util/ceg
+indir
+end
 name "LED link editor"
 dir util/led
 end
@@ -63,16 +84,69 @@ end
 name "C frontend"
 dir lang/cem/cemcom
 end
+name "ANSI-C frontend"
+dir lang/cem/cemcom.ansi
+end
+name "ANSI-C preprocessor"
+dir lang/cem/cpp.ansi
+end
+name "ANSI-C header files"
+dir lang/cem/libcc.ansi
+end
+name "LINT C program checker"
+dir lang/cem/lint
+end
+name "EM definition lint-library"
+action "make lintlib"
+dir util/data
+end
+name "Modules lint libraries"
+dir modules/src
+indir "Action.lint"
+end
+name "Global optimizer lint libraries"
+dir util/ego/share
+action "make lintlib"
+end
+name "Pascal frontend"
+dir lang/pc/comp
+end
 name "Basic frontend"
 dir lang/basic/src
 end
 name "Occam frontend"
 dir lang/occam/comp
 end
+name "Modula-2 frontend"
+dir lang/m2/comp
+end
+name "Modula-2 definition modules"
+dir lang/m2/libm2
+end
+name "Modula-2 makefile generator"
+dir lang/m2/m2mm
+end
+name "Fortran to C compiler"
+dir lang/fortran/comp
+end
+name "EM interpreter in C"
+dir util/int
+end
+name "Symbolic debugger"
+dir util/grind
+end
 name "Intel 8086 support"
 dir mach/i86
 indir
 end
+name "Intel 80286 support for Xenix"
+dir mach/xenix3
+indir
+end
+name "Intel 80386 support for Xenix 386 System V"
+dir mach/i386
+indir
+end
 name "MSC6500 support"
 dir mach/6500
 indir
@@ -94,15 +168,15 @@ dir mach/i80
 indir
 end
 name "2-2 Interpreter support"
-dir mach/int22
+dir mach/em22
 indir
 end
 name "2-4 Interpreter support"
-dir mach/int24
+dir mach/em24
 indir
 end
 name "4-4 Interpreter support"
-dir mach/int44
+dir mach/em44
 indir
 end
 name "Motorola 68000 2-4 support"
@@ -145,6 +219,16 @@ name "Sun 3 M68020 support"
 dir mach/sun3
 indir
 end
+name "Sun 4 SPARC SunOs 4 support"
+dir mach/sparc
+system "sparc|sparc_solaris"
+indir
+end
+name "Sun 4 SPARC Solaris support"
+dir mach/sparc_solaris
+system "sparc_solaris"
+indir
+end
 name "Sun 2 M68000 support"
 dir mach/sun2
 indir
@@ -153,6 +237,14 @@ name "Mantra M68000 System V.0 support"
 dir mach/mantra
 indir
 end
+name "PC Minix support"
+dir mach/minix
+indir
+end
+name "Atari ST Minix support"
+dir mach/minixST
+indir
+end
 name "Z80 support"
 dir mach/z80
 indir
@@ -161,6 +253,24 @@ name "Zilog Z8000 support"
 dir mach/z8000
 indir
 end
-name "Pascal frontend"
-dir lang/pc/pem
+name "Acorn Archimedes support"
+dir mach/arm
+indir
+end
+name "Documentation"
+dir doc
+end
+name "Motorola 68000 interpreters"
+system "m68*|sun*"
+dir mach/mantra/int
+end
+name "Fast compilers"
+system "m68020|sun3|i386|vax*"
+dir fast
+indir
+end
+name "Fast cc-compatible C compiler"
+system "sun3|vax*"
+dir fcc
+indir
 end

CHANGES

@@ -0,0 +1,35 @@
+# $Source$
+# $State$
+# $Revision$
+
+6.0pre4
+
+  Fixed some minor bit-rotting issues that were preventing compilation on
+  modern Linux systems.
+  
+6.0pre3
+
+  Added the cpm platform. Made some optimisations to the i80 code generator,
+  including getting topgen up and running and adding some peephole optimiser
+  rules. Fixed loads of bugs in ego so that it now works on platforms that
+  support it (pc86 and linux386). Made the floating point work on platforms
+  that support it (pc86 and linux386 again). Made stdint.h work. Lots and lots
+  of bugfixes and tweaks everywhere.
+  
+6.0pre2
+
+  Much simplified the syscall interface by disabling libmon and instead
+  calling the syscalls directly. Disabled the K&R C compiler and libc because
+  it doesn't actually gain us anything and has a high maintenance load --- the
+  ANSI C compiler works fine with K&R C. Adapted the rest of the system to
+  build with the ANSI C compiler. Rewrote the pc86 syscall interface and added
+  linux386 support, using the i386 code generator. Lots and lots of bugfixes
+  and tweaks everywhere.
+  
+6.0pre1
+
+  First working version of the 6.0 release stream. Working frontends: both C
+  compilers, Pascal, Modula-2, Basic and Occam. Working backends: i86. Working
+  platforms: pc86, the very noddy testbed setup that produces floppy disk
+  images.
+  

Copyright

@@ -1,16 +1,32 @@
-/*
- *     A M S T E R D A M   C O M P I L E R   K I T
- *
- * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
- *
- * Permission to use, sell, duplicate or disclose this software must be
- * obtained in writing. Requests for such permissions may be sent to
- *
- *      Dr. Andrew S. Tanenbaum
- *      Wiskundig Seminarium
- *      Vrije Universiteit
- *      Postbox 7161
- *      1007 MC Amsterdam
- *      The Netherlands
- *
- */
+Copyright (c) 1987, 1990, 1993, 2005 Vrije Universiteit, Amsterdam, The Netherlands.
+All rights reserved.
+
+Redistribution and use of the Amsterdam Compiler Kit in source and
+binary forms, with or without modification, are permitted provided
+that the following conditions are met:
+
+   * Redistributions of source code must retain the above copyright
+     notice, this list of conditions and the following disclaimer.
+
+   * Redistributions in binary form must reproduce the above
+     copyright notice, this list of conditions and the following
+     disclaimer in the documentation and/or other materials provided
+     with the distribution.
+
+   * Neither the name of Vrije Universiteit nor the names of the
+     software authors or contributors may be used to endorse or
+     promote products derived from this software without specific
+     prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS, AUTHORS, AND
+CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+IN NO EVENT SHALL VRIJE UNIVERSITEIT OR ANY AUTHORS OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

LICENSE

@@ -0,0 +1 @@
+Copyright

NEW

@@ -1,27 +1,45 @@
-What's new:
-	A lot of things have changed since the previous distribution.
+This is ACK distribution 5.6.
+
+This is a minor update of 5.5, the last public release from Vrije University.
+Only minor changes have been made to make the system build on modern
+platforms.
+
+The NEW document from the previous release follows.
+
+David Given
+dg@cowlark.com 2005-06-24
+
+-----------------------------------------------------------------------------
+
+The only addition with respect to the 5th ACK distribution is the support
+for Solaris 2 on SPARCs. It also contains many bug fixes.
+
+Notes for the 5th ACK distribution:
+
 It is not wise to mix files created by the previous version of the Kit
 with files belonging to this version, although that might sometimes work.
-The major changes are:
-	- a new C-compiler and runtime system
-	- a new C preprocessor
-	- new assembler framework, allowing the generation of relocatable
-	  object code for most processors
-	- new versions of all assemblers, using the new assembler framework
-	- a new link-editor, linking is now a separate and fast phase for most
-	  machines
-	- improved Pascal compiler, now also handles 4-byte wordsize
-	- Motorola M68020 backend and assembler
-	- Support for (some) SUN systems
-	- improved version of LL(1) parser generator, producing faster code
-	- a new language: Occam
-	- better System V support, the Kit should now just compile and run
+Many problems with the previous distribution have been fixed.
+The major additions are:
 
-				Ceriel J.H. Jacobs
-				Dept. of Math. and Computer Science
-				Vrije Universiteit
-				Postbus 7161
-				1007 MC  Amsterdam
-				The Netherlands
+	- an ANSI C compiler
+	- a LINT C program checker, both non-ansi and ansi
+	- an Intel 80386 back-end
+	- a SPARC code expander
+	- a source level debugger for Pascal, Modula-2, C, and ANSI C
+	- an Acorn Archimedes back-end
+	- code-expanders for VAX, Intel 80386 and Motorola M68020 processors,
+	  and very fast Pascal, Modula-2, ANSI C, and C compilers constructed
+	  using these code expanders
+	- a cc-compatible very fast C compiler for SUN-3 and VAX.
 
-				(UseNet: ceriel@cs.vu.nl)
+Also added, but not part of the Kit proper are
+	- flex: a lexical analyzer generator
+	- byacc: yacc-clone by UCB
+	- f2c: a Fortran to C compiler by AT&T.
+
+See the ACK installation manual for their copyright notices.
+
+--
+Ceriel Jacobs, Dept. of Mathematics and Computer Science, Vrije Universiteit,
+De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
+Email:	ceriel@cs.vu.nl		Fax: +31 20 6427705

README

@@ -1,2 +1,166 @@
-Before starting installation you should read
-the file doc/install.pr
+THE AMSTERDAM COMPILER KIT V6.0pre4
+===================================
+
+© 1987-2005 Vrije Universiteit, Amsterdam 2010-08-08
+
+
+INTRODUCTION
+============
+
+The Amsterdam Compiler Kit is a complete compiler toolchain consisting of
+front end compilers for a number of different languages, code generators,
+support libraries, and all the tools necessary to go from source code to
+executable on any of the platforms it supports.
+
+This is an early prerelease of the apocryphal version 6.0 release. Not a
+lot is supported, the build mechanism needs work, and a lot of things are
+probably broken. However, what's there should be sufficient to get things
+done and to evaluate how the full 6.0 release should work. 
+
+
+SUPPORT
+=======
+
+Languages:
+
+ANSI C, Pascal, Modula 2. K&R is supported via the ANSI C compiler.
+
+Platforms:
+
+pc86          produces bootable floppy disk images for 8086 PCs
+linux386      produces ELF executables for PC Linux systems
+cpm           produces i80 CP/M .COM files
+
+
+INSTALLATION
+============
+
+The version 6.0 build mechanism has been completely rewritten and is based
+around the Prime Mover build tool (see http://primemover.sf.net for more
+information). Installation ought to be fairly straightforward.
+
+Requirements:
+
+- an ANSI C compiler. Currently, I'm afraid, it's hard-coded to use gcc.
+  To change, try changing the variable definitions in first/c.pm. This also
+  needs to be available as 'cc' from the shell.
+  
+- about 20MB free in /tmp (or some other temporary directory).
+
+- about 6MB in the target directory.
+
+Instructions:
+
+- edit config.pm. There's a small section at the top containing some editable
+  variables. Probably the only one you may want to edit is PREFIX, which
+  changes where the ACK installs to.
+  
+- Run:
+
+    ./pm configure
+    
+  ...from the command line. This will write out a configuration file.
+  
+- Run:
+
+    ./pm
+    
+  ...from the command line. This will actually do the build. This takes
+  about two minutes on my 1.6GHz Athlon Linux machine and about 30 on my
+  166MHz Pentium OpenBSD machine.
+  
+- Run:
+
+    ./pm install
+    
+  ...from the command line (possibly with sudo). This will install the built
+  ACK into whatever directory you nominated in PREFIX.
+  
+The ACK should now be ready to use.
+
+
+USAGE
+=====
+
+Currently I haven't sorted out all the documentation --- it's supplied in the
+distribution, but not all of it gets installed yet --- so here is a quickstart
+guide.
+
+The main command to use is 'ack'. This invokes the compiler and the linker.
+Some useful options include:
+
+  -m<platform>     build for the specified platform
+  -o <file>        specifies the output file
+  -c               produce a .o file
+  -c.s             produce a .s assembly file
+  -O               enable optimisation
+  -ansi            compile ANSI C (when using the C compiler)
+  <file>           build file
+
+ack figures out which language to use from the file extension:
+
+  .c               C (ANSI or K&R)
+  .b               Basic
+  .mod             Modula-2
+  .ocm             Occam 1
+  .p               Pascal
+  .o               object files
+  .s               assembly files
+
+For further information, see the man page (which actually does get
+installed, but is rather out of date).
+
+There are some (known working) example programs in the 'examples' directory.
+A sample command line is:
+
+ack -mlinux386 -O examples/paranoia.c
+
+
+GOTCHAS
+=======
+
+There are some things you should be aware of.
+
+- Look at plat/<PLATFORMNAME>/README for information about the two supported
+  platforms.
+  
+- The library support is fairly limited; for C, it's at roughly the ANSI C
+  level, and for the other languages it's similar.
+  
+- When compiling languages other than C, the ACK will usually look at the
+  first character of the file. If it's a #, then the file will be run through
+  the C preprocessor anyway.
+
+- BSD systems may need to up the number of file descriptors (e.g.
+  'ulimit -n 200') before the ACK will compile.
+  
+- The ACK uses its own .o format. You won't be able to mix the ACK's object
+  files and another compiler's.
+
+
+DISCLAIMER
+==========
+
+The ACK is mature, well-tested software, but the environment in which it was
+developed for and tested under is rather different from that available on
+today's machines. There will probably be little in the way of logical bugs,
+but there may be many compilation and API bugs.
+
+If you wish to use the ACK, *please* join the mailing list. We are interested
+in any reports of success and particularly, failure. If it does fail for you,
+we would love to know why, in as much detail as possible. Bug fixes are even
+more welcome.
+
+The ACK is licensed under a BSD-like license. Please see the 'Copyright' file
+for the full text.
+
+You can find the mailing list on the project's web site:
+
+	http://tack.sourceforge.net/
+	
+Please enjoy.
+
+David Given (dtrg on Sourceforge)
+dg@cowlark.com
+2010-08-08
+

README.md

@@ -0,0 +1 @@
+README

TODO

@@ -0,0 +1,20 @@
+# $Source$
+# $State$
+
+This file contains things that I have noticed need fixing, but have not
+yet been fixed. Everything here should be reasonably low priority. Some
+bugs have been bodged around to make things work; these are all marked in
+the source with FIXME tags.
+
+
+* util/int needs to be rewritten to emulate sgtty with termios; look for
+  FIXMEs.
+
+* mach/i80/dl/nascom.c needs to be rewritten to use termios, not sgtty.
+
+
+# Revision history
+# $Log$
+# Revision 2.1  2005-06-24 23:20:41  dtrg
+# Added some new readmes at the top level.
+#

TakeAction

@@ -1,8 +1,10 @@
+#!/bin/sh
+
 case $# in
-0)	PAR=install ; CMD=Action ;;
+0)	PAR='make install && make clean' ; CMD=Action ;;
 1)	PAR="$1" ; CMD=Action ;;
 2)	PAR="$1" ; CMD="$2" ;;
-*)	echo Syntax: "$0" [param [file]] ; exit 1 ;;
+*)	echo Syntax: "$0" [command [file]] ; exit 1 ;;
 esac
 if test -r "$CMD"
 then :
@@ -12,7 +14,17 @@ else
 	*)		echo No Action file "($CMD)" present ;;
 	esac
 fi
-THISFILE=`pwd`/$0
+case $0 in
+/*)	THISFILE=$0
+	;;
+*)	if [ -f $0 ]
+	then
+		THISFILE=`pwd`/$0
+	else
+		THISFILE=$0
+	fi
+	;;
+esac
 SYS=
 RETC=0
 { while read LINE
@@ -21,7 +33,7 @@ do
 	case x"$1" in
 	x!*)	;;
 	xname)		SYS="$2"
-			ACTION='make $PAR'
+			ACTION='$PAR'
 			DIR=.
 			FM=no
 			FAIL='Failed for $SYS, see $DIR/Out'
@@ -63,26 +75,45 @@ do
 			x)	echo Missing name line; RETC=65 ;;
 			*)	if test -d $DIR
 				then (
-				     cd $DIR
-				     X=
-				     case $ATYPE in
-				     indir)	
-					     if sh $THISFILE $PAR $ACTION
-					     then eval echo $SUCC
-					     else RETC=2 ; eval echo $FAIL
-					     fi ;;
-				     *)
-					     if eval "$ACTION >Out 2>&1 </dev/null"
-					     then eval echo $SUCC
-					     else RETC=1 ; X=: ; eval echo $FAIL
-					     fi
-					     ;;
-				     esac
-				     (echo ------- `pwd`
-				      cat Out
-				      $X rm -f Out
-				     ) 2>/dev/null 1>&- 1>&3
-				     exit $RETC
+				    cd $DIR
+				    X=
+				    case $ATYPE in
+				    indir)	
+					if $THISFILE "$PAR" $ACTION
+					then eval echo $SUCC
+					else RETC=2 ; eval echo $FAIL
+					fi ;;
+				    *)
+					case "$ACTION" in
+					'$PAR')
+					    	ACTION="$PAR"
+					    ;;
+					*)  ;;
+					esac
+					if [ -f No$CMD ]
+					then
+					    x=`cat No$CMD`
+					    if [ "$ACTION" = "$x" ]
+					    then
+						ACTION='echo "No actions performed, No$CMD file present"'
+						SUCC='$SYS -- skipped'
+					    fi
+					fi
+					if eval "{ $ACTION ; } >Out 2>&1 </dev/null"
+					then	eval echo $SUCC
+						if [ "$SUCC" = '$SYS -- skipped' ]
+						then :
+						else echo "$ACTION" > No$CMD 2>/dev/null
+						fi
+					else RETC=1 ; X=: ; eval echo $FAIL
+					fi
+					;;
+				    esac
+				    (echo ------- `pwd`
+				     cat Out
+				     $X rm -f Out
+				    ) 2>/dev/null 1>&- 1>&3
+				    exit $RETC
 				)
 				case $? in
 				0) ;;

bin/.distr

@@ -1 +1,9 @@
-em.pascal
+cc-and-mkdep.ack
+cc-and-mkdep.all
+cc-and-mkdep.sun
+do_deps
+do_resolve
+lint-lib.ack
+lint-lib.unix
+mk_manpage
+rm_deps

bin/cc-and-mkdep.ack

@@ -0,0 +1,8 @@
+#!/bin/sh
+: '$Id$'
+
+: Compile and make dependencies. First argument is the file on which the
+: dependencies must be produced. This version is for ACK.
+n=$1
+shift
+exec $CC -Rcem-A$n -Rcem-m $*

bin/cc-and-mkdep.all

@@ -0,0 +1,21 @@
+#!/bin/sh
+: '$Id$'
+
+: Compile and make dependencies. First argument is the file on which the
+: dependencies must be produced. This version is a generic one that should
+: work for all Unix systems.
+n=$1
+shift
+cpp_args=
+for i in $*
+do
+	case $i in
+	-I*|-D*|-U*)	cpp_args="$cpp_args $i"
+			;;
+	-*)		;;
+	*)		cpp_args="$cpp_args $i"
+			;;
+	esac
+done
+$UTIL_HOME/lib.bin/cpp -d -m $cpp_args > $n 2>/dev/null
+exec $CC $*

bin/cc-and-mkdep.sun

@@ -0,0 +1,8 @@
+#!/bin/sh
+: '$Id$'
+
+: Compile and make dependencies. First argument is the file on which the
+: dependencies must be produced. This version is for the SUN cc.
+n=$1
+shift
+exec $CC -Qpath $UTIL_HOME/lib.bin -Qoption cpp -d$n -Qoption cpp -m $*

bin/do_deps

@@ -0,0 +1,19 @@
+#!/bin/sh
+: '$Id$'
+
+: Produce dependencies for all argument files
+
+for i in $*
+do
+	n=`basename $i .c`
+	if [ -f $n.dep ]
+	then
+		:
+	else
+		echo $n.'$(SUF):	'$i > $n.dep
+		echo "	head -5 $n.dep > $n.dp1" >> $n.dep
+		echo '	CC="$(CC)" UTIL_HOME="$(UTIL_HOME)" $(CC_AND_MKDEP) '$n.dp2 '$(CFLAGS)' -c $i >> $n.dep
+		echo "	cat $n.dp1 $n.dp2 > $n.dep" >> $n.dep
+		echo "	rm -f $n.dp1 $n.dp2" >> $n.dep
+	fi
+done

bin/do_resolve

@@ -0,0 +1,48 @@
+#!/bin/sh
+: '$Id$'
+
+: Resolve name clashes in the files on the argument list. If these
+: files reside in another directory, a copy is made in the current
+: directory. If not, it is overwritten. Never do this in a source
+: directory! A list of the new files is produced on standard output.
+
+UTIL_BIN=$UTIL_HOME/bin
+
+trap "rm -f tmp$$ a.out nmclash.* longnames clashes" 0 1 2 3 15
+
+: first find out if we have to resolve problems with identifier significance.
+
+cat > nmclash.c <<'EOF'
+/* Accepted if many characters of long names are significant */
+abcdefghijklmnopr() { }
+abcdefghijklmnopq() { }
+main() { }
+EOF
+if $CC nmclash.c
+then	: no identifier significance problem
+	for i in $*
+	do
+		echo $i
+	done
+else
+	$UTIL_BIN/prid -l7 $* > longnames
+
+	: remove code generating routines from the clashes list.
+	: code generating routine names start with C_.
+	: also remove names starting with flt_.
+
+	sed '/^C_/d' < longnames | sed '/^flt_/d' > tmp$$
+	$UTIL_BIN/cclash -c -l7 tmp$$ > clashes
+	for i in $*
+	do
+		$UTIL_BIN/cid -Fclashes < $i > tmp$$
+		n=`basename $i .xxx`
+		if cmp -s $n tmp$$
+		then
+			rm -f tmp$$
+		else
+			mv tmp$$ $n
+		fi
+		echo $n
+	done
+fi

bin/em.pascal

@@ -1 +0,0 @@
-exec /usr/em/doc/em/int/em /usr/em/doc/em/int/tables ${1-e.out} core

bin/lint-lib.ack

@@ -0,0 +1,13 @@
+#!/bin/sh
+: '$Id$'
+
+: Create a lint library file. The name of the library file is constructed
+: from the first argument. The second argument indicates the directory where
+: the result is to be placed. This version is for ACK lint.
+
+n=$1
+shift
+d=$1
+shift
+lint -L$n $*
+mv $n.llb $d

bin/lint-lib.unix

@@ -0,0 +1,13 @@
+#!/bin/sh
+: '$Id$'
+
+: Create a lint library file. The name of the library file is constructed
+: from the first argument. The second argument indicates the directory where
+: the result is to be placed. This version is for Unix lint.
+
+n=$1
+shift
+d=$1
+shift
+/usr/bin/lint -C$n $*
+mv llib-l$n.ln $d

bin/mk_manpage

@@ -0,0 +1,20 @@
+#!/bin/sh
+
+num=`expr $1 : '.*\.\([1-8]\)'`
+
+if [ -d $2/man ] ; then : ; else mkdir $2/man ; fi
+if [ -f $2/man/head ] ; then : ; else cat > $2/man/head <<'EOF'
+.rn TH yy
+.de TH
+.di zz
+.yy "\\$1" "\\$2" "\\$3" "\\$4"
+.ds ]W 5th ACK distribution
+.ds ]D Amsterdam Compiler Kit
+.ds ]L "\\$3
+.di
+.rm zz
+..
+EOF
+fi
+if [ -d $2/man/man$num ] ; then : ; else mkdir $2/man/man$num ; fi
+cat $2/man/head $1  | sed "s!TARGETHOME!$2!" > $2/man/man$num/`expr //$1 : '.*/\([^/]*\)'`

bin/rm_deps

@@ -0,0 +1,9 @@
+#!/bin/sh
+: $Id$
+
+: remove dependencies from a makefile, write result on standard output.
+: we cannot do this directly in a makefile because some make versions
+: have # start a comment, always.
+
+sed -e '/^#DEPENDENCIES/,$d' $1
+echo '#DEPENDENCIES'

config.pm

@@ -0,0 +1,71 @@
+-- ======================================================================= --
+--                          ACK CONFIGURATION                              --
+--                      (Edit this before building)                        --
+-- ======================================================================= --
+
+-- What platform to build for by default?
+
+DEFAULT_PLATFORM = "pc86"
+
+-- Where should the ACK put its temporary files?
+
+ACK_TEMP_DIR = "/tmp"
+
+-- Where is the ACK going to be installed, eventually?
+
+PREFIX = "/usr/local"
+
+-- ======================================================================= --
+--                       BROKEN ACK CONFIGURATION                          --
+--                       (Currently not editable)                          --
+-- ======================================================================= --
+
+-- FIXME: the following two variables must be set to their Minix variants
+-- due to hard-coded references in the descr files.
+
+-- Name of the platform-independent library directory; 'share' on modern
+-- systems, 'lib' on Minix-like systems.
+
+PLATIND = "lib"
+
+-- Name of the platform-dependent library directory; 'lib' on modern
+-- systems, 'lib.bin' on Minix-like systems.
+
+PLATDEP = "lib.bin"
+
+-- ======================================================================= --
+--                      BUILD SYSTEM CONFIGURATION                         --
+--                        (Not user servicable)                            --
+-- ======================================================================= --
+
+-- Absolute path to the ACK source directory.
+
+ROOTDIR = posix.getcwd().."/"
+
+-- Temporary directory used during the build process.
+
+TEMPDIR = "/tmp/ack-temp/"
+
+-- Directory in which dynamically generated header files will go during
+-- the build process.
+
+HEADERDIR = TEMPDIR.."headers/"
+
+-- Directory in which tools used by the build process but which not actually
+-- deployed with the ACK will go.
+
+TOOLDIR = TEMPDIR.."tools/"
+
+-- Directory in which the libraries used to build the ACK tools but which are
+-- not actually deployed with the ACK will go.
+
+LIBDIR = TEMPDIR.."lib/"
+
+-- Staging area where the installation will be built before actually copying
+-- it.
+
+BINDIR = TEMPDIR.."staging/"
+
+-- Directory that the pm cache goes in.
+
+pm.intermediate_cache_dir = TEMPDIR.."pmcache/"

distr/Exceptions

@@ -0,0 +1,15 @@
+++ ./doc/install.pr made
+++ ./doc/int/.distr made
+++ ./etc/new_table_done made
+++ ./lang/cem/cemcom.ansi/Version.c made
+++ ./lang/cem/libcc.ansi/stdlib/malloc.c made
+++ ./lang/cem/cemcom/Version.c made
+++ ./lang/pc/comp/Version.c made
+++ ./lang/m2/comp/Version.c made
+++ ./lang/m2/m2mm/Version.c made
+++ ./mach/sparc/ce/EM_table made
+++ ./mach/sparc_solaris/libem/LIST made
+++ ./util/LLgen/src/LLgen.c.dist made
+++ ./util/cpp/Version.c made
+++ ./util/ego/share/pop_push.h made
+++ ./util/grind/ops.c made

distr/How_To

@@ -0,0 +1,90 @@
+How to make a distribution
+--------------------------
+
+I have written a new tool to generate the distributions that does not rely on
+having a local CVS server --- distr/mkdist.
+
+To use it, you need to specify your CVS work tree, the destination directory
+that the distribution will be written to, plus flags. It should be self-
+documenting; use:
+
+	mkdist --help
+	
+...to get documentation.
+
+It uses .distr files in exactly the same way as the previous mechanism.
+
+The documentation for the old distribution tools follows.
+
+David Given
+dg@cowlark.com
+2005-06-25
+
+-----------------------------------------------------------------------------
+
+How to make a fresh distribution:
+For a distribution you need ".distr" files and RCS files.
+The EM home directory contains a file called ".distr". It contains
+the names of all the files and directories you want to have in the distribution.
+The directories should contain .distr files, the other files should
+be placed under CVS.
+There are files that derive from other files and yet should be placed
+in the distribution.
+These files should not be placed under RCS or CVS.
+The file "Exceptions" in this directory contains the current list of
+these files.
+
+When all this is correct, use the shell script mktree the extract
+the distribution from the EM tree.
+	sh mktree destination_tree repository_tree <distrname> 2>f.attf
+Use the "cvs rtag" command to give the distribution a name first!
+Make sure that the destination tree exists and is empty!
+Failing to do that will almost certainly result in a welter of
+error messages.
+The file f.attf contains mktree error messages and should be compared
+to Exceptions.
+The actions of mktree are quite complicated. It starts in the current
+directory creating a version in the destination directory.
+Then it reads the .distr file.
+For each file mentioned there it performes certain actions:
+1- Directory	Change to that directory and call yourself recursively.
+2- File
+   a-               Does a file LIST exist in this directory AND
+                    is the first line of LIST equal to the name of the
+                    destination file? If so, try to extract all the files
+                    named in the rest of the LIST file and call the program
+                    arch to create a library "arch cDr `cat LIST`".
+                    In this manner libraries can be distributed whose members
+                    have their own RCS file.
+              else
+   b-		    Try to run 'make distr'
+	      else
+   c-		    Try to run 'make <filename>'
+	      else
+   d-               give message that says "not present" (or some such). 
+
+Now, the tree contains all the files in the distribution, but it also contains
+files that should not be in the distribution, especially the files created
+by CVS.
+That is why we now give the command:
+	dtar cdf distr .
+The file distr is the one you should put on tape!
+But,.... before doing that: Try it out!
+Repeat the process described in the installation manual.
+Only if that succeeds you are sure that you included the files needed.
+					Good Luck,
+						Ed Keizer, 85/4/15.
+
+Updated for 3rd distribution by Ceriel Jacobs, 87/3/11.
+And again,
+					Good Luck!
+
+Updated for 4th distribution by Ceriel Jacobs, 88/4/08.
+And again,
+					Good Luck!
+Updated for 5th distribution by Ceriel Jacobs, 91/19/12.
+And again,
+					Good Luck!
+Updated for 1st upgrade to 5th distribution by Ceriel Jacobs, 91/12/11.
+And again,
+					Good Luck!

distr/dwalk

@@ -0,0 +1,26 @@
+#!/bin/sh
+
+: ${CDIR=.}
+${DF-:} $CDIR .distr
+if test ! -r $DESTDIR/$CDIR/.distr
+then
+	echo ++ no .distr in $CDIR 1>&2
+        exit 0
+fi
+for i in `cat $DESTDIR/$CDIR/.distr`
+do
+        if test -d $i
+        then
+                ( if cd $i
+		  then 
+			CDIR=$CDIR/$i
+			export CDIR
+			exec $DDIR/dwalk $*
+		  else
+			echo ++ Could not access $CDIR/$i 1>&2
+		  fi
+		)
+	else
+		${DF-:} $CDIR $i
+        fi
+done

distr/echod

@@ -0,0 +1 @@
+echo $1

distr/listall

@@ -0,0 +1,10 @@
+case $# in
+0)	DESTDIR=. ;;
+1)	DESTDIR=$1 ;;
+*)	echo $0 [directory] ; exit 1 ;;
+esac
+DD=`pwd`/listall.d
+DW=`pwd`/dwalk
+export DD DESTDIR
+cd $DESTDIR
+$DW

distr/listall.d

@@ -0,0 +1,2 @@
+echo "<$1>"
+ls -bCdx `cat .distr`

distr/listdirs

@@ -0,0 +1,10 @@
+case $# in
+0)	DIR=. ;;
+1)	DIR=$1 ;;
+*)	echo $0 [directory] ; exit 1 ;;
+esac
+DD=`pwd`/echod
+DW=`pwd`/dwalk
+export DD
+cd $DIR
+$DW

distr/mk_distr_syms

@@ -0,0 +1,40 @@
+#!/bin/sh
+: Utility to make a tree of symbolic links to source tree.
+: Mount the source tree read-only, use this script, and then try installation.
+case $# in
+2)	;;
+*)	echo "Usage: $0 <source-tree> <symlink-tree>" 1>&2
+	exit 1
+	;;
+esac
+if [ -f $1/.distr ]
+then
+	for i in `cat $1/.distr`
+	do
+		if [ -d $1/$i ]
+		then
+			if mkdir $2/$i && $0 $1/$i $2/$i
+			then
+				:
+			else
+				exit 2
+			fi
+		else
+			if [ -f $1/$i ] 
+			then
+				if ln -s $1/$i $2/$i
+				then
+					:
+				else
+					exit 3
+				fi
+			else
+				echo "Missing file $1/$i" 1>&2
+				exit 4
+			fi
+		fi
+	done
+else
+	echo "No .distr file in $1" 1>&2
+	exit 5
+fi

distr/mka

@@ -0,0 +1,11 @@
+#!/bin/sh
+
+set -e
+for i in `tail +2 $DESTDIR/$1/LIST`
+do
+	${DF-false} $1 $i
+done
+cd $DESTDIR/$1
+arch cDr `cat LIST`
+: I do not remove the files constituating the library, because
+: they might be present in .distr

distr/mkdist

@@ -0,0 +1,177 @@
+#!/bin/sh
+# $Source$
+# $State$
+
+# Set up default variables.
+
+destdir=
+srcdir=`pwd`
+arch=/usr/local/bin/arch
+delete=no
+copy="ln"
+
+# --- Options parsing -------------------------------------------------------
+
+while [ "$1" != "" ]; do
+	case "$1" in
+		-s|--srcdir)
+			srcdir="$2"
+			shift
+			;;
+			
+		-d|--destdir)
+			destdir="$2"
+			shift
+			;;
+			
+		-x|--delete)
+			delete=yes
+			;;
+			
+		-c|--copy)
+			copy="cp -Rp"
+			;;
+			
+		-S|--symlink)
+			copy="ln -s"
+			;;
+			
+		-a|--arch)
+			arch="$2"
+			shift
+			;;
+			
+		-h|--help)
+			echo "mkdist [options]"
+			echo "Options are:"
+			echo "  -s --srcdir <path>   The CVS tree to read from. (default: CWD)"
+			echo "  -d --destdir <path>  The directory to create the distribution in."
+			echo "  -x --delete          Erase the destination directory first."
+			echo "  -c --copy            Make physical copies of the files. (default: hardlink)"
+			echo "  -S --symlink         Make symbolic links instead of copying or hardlinking."
+			echo "  -a --arch <path>     Where the ACK 'arch' tool is."
+			echo "  -h --help            Display this message."
+			exit 0
+			;;
+			
+		*)
+			echo "Unrecognised option. Try --help for help."
+			exit 1
+	esac
+	shift
+done
+
+if [ "$destdir" = "" ]; then
+	echo "You must specify a destination directory. (Try --help for help.)"
+	exit 1
+fi
+
+# --- Main routines ---------------------------------------------------------
+
+# These two routines do the work of traversing the source tree and building
+# the distribution tree.
+
+addfile() {
+	local f
+	f="${1##$srcdir/}"
+	mkdir -p $destdir/`dirname $f`
+	$copy "$1" "$destdir/$f"
+}
+
+process_dir() {
+	local path
+	local archivename
+	
+	path=$1
+	cd $path
+	echo $PWD
+	
+	# Look for a LIST file and cache the first line.
+	
+	archivename=
+	if [ -f LIST ]; then
+		archivename=`head -1 LIST`
+	fi
+
+	for i in `cat $path/.distr`; do
+		case "$i" in
+			\#*)	# Comment. Do nothing.
+					;;
+					
+			*)
+					if [ -d $i ]; then
+						# This is a directory. Recurse into it.
+						
+						( process_dir $path/$i )
+					elif [ -f $i ]; then
+						# This is a file.
+						
+						addfile $path/$i
+					elif [ "$i" = "$archivename" ]; then
+						# Build the named archive.
+			
+						$arch cDr `cat LIST`
+						addfile $path/$archivename
+					else
+						echo "Don't know what to do with $i, listed in $PWD/.distr."
+						exit 1
+					fi
+					;;
+		esac
+	done
+}
+
+# --- Main program ----------------------------------------------------------
+
+# Test to make sure that $arch points to the right thing.
+
+if !(strings $arch | grep archiver > /dev/null); then
+	echo "$arch does not seem to point at the ACK archiver tool."
+	echo "(Don't confuse this with the Linux tool for displaying your"
+	echo "architecture.)"
+	echo ""
+	echo "Press RETURN to go ahead anyway, or CTRL+C to abort."
+	read ignored
+fi
+
+# Actually do the work.
+
+echo "Creating distribution from CVS tree: $srcdir"
+echo "              into destination tree: $destdir"
+echo ""
+
+if [ -e $destdir ]; then
+	if [ "$delete" = "yes" ]; then
+		echo "Press RETURN to erase $destdir and its contents, or CTRL+C to abort."
+		read
+		echo "Erasing..."
+		rm -rf "$destdir"
+	else
+		echo "$destdir exists. Aborting."
+		exit 1
+	fi
+fi
+
+echo "Working..."
+mkdir -p $destdir
+process_dir $srcdir
+echo "Done."
+
+# Revision history
+# $Log$
+# Revision 1.5  2007-04-24 19:48:41  dtrg
+# Removed bashish.
+#
+# Revision 1.4  2007/02/25 20:56:41  dtrg
+# Performed major renovations to make the script work on OpenBSD.
+#
+# Revision 1.3  2007/02/24 02:05:56  dtrg
+# Removed some bashish; added comment support; removed the make
+# distr functionality, as nothing was using it any more and it was
+# causing problems.
+#
+# Revision 1.2  2005/06/24 23:19:23  dtrg
+# Added new mkdist tool.
+#
+# Revision 1.1  2005/06/24 22:13:57  dtrg
+# Created new tool to generate distributions.

distr/mkf

@@ -0,0 +1,19 @@
+#!/bin/sh
+
+if [ -f $DESTDIR/$1/$2 ]
+then
+	:
+elif grep LIST $DESTDIR/$1/.distr >/dev/null 2>&1 &&
+     (test "$2" = "`head -1 $DESTDIR/$1/LIST`") >/dev/null 2>&1 &&
+     ${DA-false} "$1" "$2"
+then
+:	Fetched library contents one by one and put them together
+elif ( cd $DESTDIR/$1 ; make distr ) > /dev/null 2>&1
+then
+	echo ++ $1/$2 made 1>&2
+elif ( cd $DESTDIR/$1 ; make $2 ) > /dev/null 2>&1
+then
+	echo ++ $1/$2 made 1>&2
+else
+	echo ++ $1/$2 not present 1>&2
+fi

distr/mktree

@@ -0,0 +1,42 @@
+case $# in
+2|3)	;;
+*)	echo Usage: $0 directory repdir [ SVrecord ] 1>&2 ; exit 1 ;;
+esac
+case $0 in
+/*)	DDIR=`dirname $0`
+	;;
+*)	DDIR=`pwd`/`dirname $0`
+	;;
+esac
+case $1 in
+/*)	DESTDIR=$1 ;;
+*)	DESTDIR=`pwd`/$1 ;;
+esac
+case $2 in
+/*)	REPDIR=$2 ;;
+*)	REPDIR=`pwd`/$2 ;;
+esac
+# DD=$DDIR/mkd
+# export DD
+mkdir -p $DESTDIR
+CVSROOT=/usr/proj/em/Repositories
+export CVSROOT
+cd $DESTDIR
+case $# in
+3)
+	cvs checkout world -r $3
+	;;
+2)
+	cvs checkout world
+	;;
+esac
+cd $REPDIR
+DF=$DDIR/mkf
+DA=$DDIR/mka
+export DDIR DESTDIR DF DA REPDIR
+
+$DDIR/dwalk
+
+cd $DESTDIR
+find . -type d -print | xargs chmod "uog+rx"
+chmod -R "og-w,u+w,uog+r" .

distr/todistr

@@ -0,0 +1,26 @@
+REV=
+FILE=
+while :
+do
+	case $# in
+	0)	break ;;
+	esac
+	ARG="$1"
+	shift
+	case "$ARG" in
+	-r*)	REV=`echo "$ARG"| sed s/-r//` ;;
+	-*)	FLAGS="$FLAGS $ARG" ;;
+	*)	case x$FILE in
+		x)	FILE="$ARG" ;;
+		*)	echo todistr can only be done on one file at the time
+			exit 1 ;;
+		esac
+	esac
+done
+case x$REV in
+x)	REV=`rlog -h "$FILE"|sed -n -e '/head/s/^head:[ 	]*//p'` ;;
+esac
+case x$REV in
+x)	exit 2 ;;
+esac
+rcs -ndistr4:$REV $FLAGS $FILE

distr/ts

@@ -0,0 +1,2 @@
+DD=`pwd`/ts
+echo OK

doc/.distr

@@ -1,8 +1,11 @@
+READ_ME
 Makefile
+proto.make
 ack.doc
 basic.doc
 cg.doc
 crefman.doc
+ansi_C.doc
 em
 install.doc
 install.pr
@@ -13,11 +16,17 @@ regadd.doc
 toolkit.doc
 v7bugs.doc
 val.doc
-LLgen
 6500.doc
 i80.doc
 z80.doc
 m68020.doc
+m2ref.doc
+nopt.doc
 top
 ego
 occam
+int
+ceg
+sparc
+lint
+pascal

doc/6500.doc

@@ -1,4 +1,4 @@
-. \" $Header$"
+. \" $Id$"
 .RP
 .ND Dec 1984
 .TL

doc/LLgen/.distr

@@ -1,3 +1,4 @@
 LLgen.n
+LLgen_NCER.n
 LLgen.refs
-Makefile
+proto.make

doc/LLgen/LLgen.n

@@ -1,4 +1,4 @@
-.\"	$Header$
+.\"	$Id$
 .\"	Run this paper off with
 .\"	refer [options] -p LLgen.refs LLgen.doc | [n]eqn | tbl | (nt)roff -ms
 .if '\*(>.'' \{\
@@ -59,7 +59,7 @@ It is based on so called \fBdefault choices\fR, which are
 implicitly or explicitly specified by the user.
 .PP
 \fILLgen\fR has succesfully been used to create recognizers for
-Pascal and C.
+Pascal, C, and Modula-2.
 .AE
 .NH
 Introduction
@@ -151,7 +151,7 @@ used for grouping.
 .PP
 We can describe the syntax of an ECF syntax with an ECF syntax :
 .DS
-.ft 5
+.ft CW
 grammar         : rule +
                 ;
 .ft R
@@ -159,7 +159,7 @@ grammar         : rule +
 This grammar rule states that a grammar consists of one or more
 rules.
 .DS
-.ft 5
+.ft CW
 rule            : nonterminal ':' productionrule ';'
                 ;
 .ft R
@@ -169,7 +169,7 @@ followed by ":",
 the \fBproduce symbol\fR, followed by a production rule, followed by a
 ";", in\%di\%ca\%ting the end of the rule.
 .DS
-.ft 5
+.ft CW
 productionrule  : production [ '|' production ]*
                 ;
 .ft R
@@ -178,7 +178,7 @@ A production rule consists of one or
 more alternative productions separated by "|". This symbol is called the
 \fBalternation symbol\fR.
 .DS
-.ft 5
+.ft CW
 production      : term *
                 ;
 .ft R
@@ -186,14 +186,14 @@ production      : term *
 A production consists of a possibly empty list of terms.
 So, empty productions are allowed.
 .DS
-.ft 5
+.ft CW
 term            : element repeats
                 ;
 .ft R
 .DE
 A term is an element, possibly with a repeat specification.
 .DS
-.ft 5
+.ft CW
 element         : LITERAL
                 | IDENTIFIER
                 | '[' productionrule ']'
@@ -205,7 +205,7 @@ between apostrophes, it can be an IDENTIFIER, which is either a
 nonterminal or a token, and it can be a production rule
 between square parentheses.
 .DS
-.ft 5
+.ft CW
 repeats         : '?'
                 | [ '*' | '+' ] NUMBER ?
                 | NUMBER ?
@@ -287,7 +287,7 @@ Names representing tokens must be declared before they are used.
 This can be done using the "\fB%token\fR" keyword,
 by writing
 .nf
-.ft 5
+.ft CW
 .sp 1
 %token  name1, name2, . . . ;
 .ft R
@@ -301,7 +301,7 @@ The start symbols must be declared explicitly using the
 "\fB%start\fR" keyword. It can be used whenever a declaration is
 legal, f.i.:
 .nf
-.ft 5
+.ft CW
 .sp 1
 %start LLparse, specification ;
 .ft R
@@ -338,9 +338,14 @@ grammar rule.
 .PP
 In order to facilitate communication between the actions and
 \fILLparse\fR,
-the parsing routines can be given C-like parameters. So, for example
+the parsing routines can be given C-like parameters.
+Each parameter must be declared separately, and each of these declarations must
+end with a semicolon.
+For the last parameter, the semicolon is optional.
+.PP
+So, for example
 .nf
-.ft 5
+.ft CW
 .sp 1
 expr(int *pval;) { int fact; } :
                 /*
@@ -464,7 +469,7 @@ By default, for terms with a repetition count containing "*" or
 "?" the default choice is to continue with the rest of the rule
 in which the term appears, and
 .sp 1
-.ft 5
+.ft CW
 .nf
                 term+
 .fi
@@ -473,7 +478,7 @@ in which the term appears, and
 is treated as
 .sp 1
 .nf
-.ft 5
+.ft CW
                 term term* .
 .ft R
 .fi
@@ -488,7 +493,7 @@ the skipping of such a term can be prevented by
 using the keyword "\fB%persistent\fR".
 For instance, the rule
 .sp 1
-.ft 5
+.ft CW
 .nf
 commandlist : command* ;
 .fi
@@ -496,7 +501,7 @@ commandlist : command* ;
 .sp 1
 could be changed to
 .sp 1
-.ft 5
+.ft CW
 .nf
 commandlist : [ %persistent command ]* ;
 .fi
@@ -592,7 +597,7 @@ returning 1 if the parameter supplied can start a specified
 nonterminal, f.i.:
 .sp 1
 .nf
-.ft 5
+.ft CW
 %first fmac, nonterm ;
 .ft R
 .sp 1
@@ -635,7 +640,7 @@ parameter, whose value is a token number, zero or -1.
 A zero parameter indicates that the current token (the one in
 the external variable \fILLsymb\fR) is deleted.
 .br
-A -1 parameter indicates that the parser expected end of file, but did'nt get
+A -1 parameter indicates that the parser expected end of file, but didn't get
 it.
 The parser will then skip tokens until end of file is detected.
 .br
@@ -653,13 +658,17 @@ token.
 The user may also supply his own error recovery routines, or handle
 errors differently. For this purpose, the name of a routine to be called
 when an error occurs may be declared using the keyword \fB%onerror\fR.
-This routine takes one parameter, which is either the token number of the
+This routine takes two parameters.
+The first one is either the token number of the
 token expected, or 0. In the last case, the error occurred at a choice.
 In both cases, the routine must ensure that the next call to the lexical
 analyser returns the token that replaces the current one. Of course,
 that could well be the current one, in which case
 .I LLparse
 recovers from the error.
+The second parameter contains a list of tokens that are not skipped at the
+error point. The list is in the form of a null-terminated array of integers,
+whose address is passed.
 .PP
 The user must supply a lexical analyzer to read the input stream and
 break it up into tokens, which are passed to
@@ -671,7 +680,7 @@ This keyword can be used wherever a declaration is legal and may appear
 only once in the grammar specification, f.i.:
 .sp 1
 .nf
-.ft 5
+.ft CW
 %lexical scanner ;
 .ft R
 .fi
@@ -695,10 +704,31 @@ the "#\ define" mechanism of C is used to give them a value and
 to allow the lexical analyzer to return their token numbers symbolically.
 These "#\ define"s are collected in the file \fILpars.h\fR which
 can be "#\ include"d in any file that needs the token-names.
+The maximum token number chosen is defined in the macro \fILL_MAXTOKNO\fP.
 .PP
 The lexical analyzer must signal the end
 of input to \fILLparse\fR
 by returning a number less than or equal to zero.
+.NH
+Programs with more than one parser
+.PP
+\fILLgen\fR offers a simple facility for having more than one parser in
+a program: in this case, the user can change the names of global procedures,
+variables, etc, by giving a different prefix, like this:
+.sp 1
+.nf
+.ft CW
+%prefix XX ;
+.ft R
+.fi
+.sp 1
+The effect of this is that all global names start with XX instead of LL, for
+the parser that has this prefix. This holds for the variables \fILLsymb\fP,
+which now is called \fIXXsymb\fP, for the routine \fILLmessage\fP,
+which must now be called \fIXXmessage\fP, and for the macro \fILL_MAXTOKNO\fP,
+which is now called \fIXX_MAXTOKNO\fP.
+\fILL.output\fP is now \fIXX.output\fP, and \fILpars.c\fP and \fILpars.h\fP
+are now called \fIXXpars.c\fP and \fIXXpars.h\fP.
 .bp
 .SH
 References
@@ -713,7 +743,7 @@ This appendix has a description of the \fILLgen\fR input syntax,
 as a \fILLgen\fR specification. As a matter of fact, the current
 version of \fILLgen\fR is written with \fILLgen\fR.
 .nf
-.ft 5
+.ft CW
 .sp 2
 /*
  * First the declarations of the terminals
@@ -737,6 +767,7 @@ version of \fILLgen\fR is written with \fILLgen\fR.
 %token  PREFER;        /* %prefer */
 %token  DEFAULT;       /* %default */
 %token  LEXICAL;       /* %lexical */
+%token  PREFIX;        /* %prefix */
 %token  ONERROR;       /* %onerror */
 %token  FIRST;         /* %first */
 
@@ -767,6 +798,9 @@ declaration
         | LEXICAL
                 IDENTIFIER
           ';'
+        | PREFIX
+                IDENTIFIER
+          ';'
         | ONERROR
                 IDENTIFIER
 	  ';'
@@ -785,11 +819,12 @@ ldecl   : '{'
 
 productions
         : simpleproduction
-          [ '|' DEFAULT? simpleproduction ]*
+          [ '|' simpleproduction ]*
         ;
 
 simpleproduction
-        : [ IF '(' /* Read C-expression here */ ')'
+        : DEFAULT?
+	  [ IF '(' /* Read C-expression here */ ')'
           | PREFER
           | AVOID
           ]?
@@ -842,7 +877,7 @@ priority. The example shows how we can do it all with one
 nonterminal, no matter how many priority levels there are.
 .sp 1
 .nf
-.ft 5
+.ft CW
 {
 #include <stdio.h>
 #include <ctype.h>
@@ -891,38 +926,37 @@ stat    {       int     ident, val; } :
         | '\en'
         ;
 
-expr(int level, *val;) {       int     expr; } :
-        %if (level <= MAXPRIO)
-                    /* The grammar is ambiguous here. If level > MAXPRIO,
-                     * this invocation will only scan one factor
-                     */
-            expr(MAXPRIO+1,val)
-            [ %while (prio(tok.t_tokno) >= level)
+expr(int level; int *val;) {       int     expr; } :
+          factor(val)
+          [ %while (prio(tok.t_tokno) >= level)
                     /* Swallow operators as long as their priority is
                      * larger than or equal to the level of this invocation
                      */
-                '+' expr(prio('+')+1,&expr)
+              '+' expr(prio('+')+1,&expr)
                                 {       *val += expr; }
                     /* This states that '+' groups left to right. If it
                      * should group right to left, the rule should read:
                      * '+' expr(prio('+'),&expr)
                      */
-              | '-' expr(prio('-'),&expr)
+            | '-' expr(prio('-')+1,&expr)
                                 {       *val -= expr; }
-              | '*' expr(prio('*'),&expr)
+            | '*' expr(prio('*')+1,&expr)
                                 {       *val *= expr; }
-              | '/' expr(prio('/'),&expr)
+            | '/' expr(prio('/')+1,&expr)
                                 {       *val /= expr; }
-              | '%' expr(prio('%'),&expr)
+            | '%' expr(prio('%')+1,&expr)
                                 {       *val %= expr; }
-              | '&' expr(prio('&'),&expr)
+            | '&' expr(prio('&')+1,&expr)
                                 {       *val &= expr; }
-              | '|' expr(prio('|'),&expr)
+            | '|' expr(prio('|')+1,&expr)
                                 {       *val |= expr; }
-            ]*
+          ]*
                     /* Notice the "*" here. It is important.
                      */
-          | '(' expr(1,val) ')'
+	;
+
+factor(int *val;):
+            '(' expr(1,val) ')'
           | '-' expr(MAXPRIO+1,val)
                                 {       *val = -*val; }
           | number(val)
@@ -978,7 +1012,8 @@ main() {
         ptab['-'] = 3;
         ptab['&'] = 2;
         ptab['|'] = 1;
-        return parse();
+        parse();
+	exit(nerrors);
 }   }
 .fi
 .ft R
@@ -1003,7 +1038,7 @@ one file.
 As usual, there is a way around this problem.
 A sample makefile follows:
 .sp 1
-.ft 5
+.ft CW
 .nf
 # The grammar exists of the files decl.g, stat.g and expr.g.
 # The ".o"-files are the result of a C-compilation.

doc/LLgen/LLgen.refs

@@ -13,7 +13,7 @@
 %A M. E. Lesk
 %I Bell Laboratories
 %D October 1975
-%C Murrey Hill, New Jersey
+%C Murray Hill, New Jersey
 %R Comp. Sci. Tech. Rep. No. 39
 
 %T Yacc: Yet Another Compiler Compiler

doc/LLgen/Makefile

@@ -1,8 +1,15 @@
-# $Header$
+# $Id$
 
+GRAP=grap
+PIC=pic
 EQN=eqn
 REFER=refer
 TBL=tbl
 
+all:		../LLgen.doc ../LLgen_NCER.doc
+
 ../LLgen.doc:	LLgen.n LLgen.refs
 		$(REFER) -sA+T -p LLgen.refs LLgen.n | $(EQN) | $(TBL) > $@
+
+../LLgen_NCER.doc:	LLgen_NCER.n
+		$(GRAP) LLgen_NCER.n | pic | eqn > $@

doc/LLgen/proto.make

@@ -0,0 +1,20 @@
+# $Id$
+
+#PARAMS         do not remove this line!
+
+SRC_DIR = $(SRC_HOME)/doc/LLgen
+
+GRAP=grap
+PIC=pic
+EQN=eqn
+REFER=refer
+TBL=tbl
+
+all:	$(TARGET_HOME)/doc/LLgen.doc $(TARGET_HOME)/doc/LLgen_NCER.doc
+
+$(TARGET_HOME)/doc/LLgen.doc:	$(SRC_DIR)/LLgen.n $(SRC_DIR)/LLgen.refs
+	$(REFER) -sA+T -p $(SRC_DIR)/LLgen.refs $(SRC_DIR)/LLgen.n | $(EQN) | $(TBL) > $@
+
+$(TARGET_HOME)/doc/LLgen_NCER.doc:      $(SRC_DIR)/LLgen_NCER.n
+		$(GRAP) $(SRC_DIR)/LLgen_NCER.n | pic | eqn > $@
+

doc/Makefile

@@ -1,68 +1,82 @@
-# $Header$
+# $Id$
 
-SUF=pr
-PRINT=cat
-NROFF=nroff
-TBL=tbl
-EQN=eqn
-PIC=pic
-REFER=refer
+# This Makefile is not supposed to be used in the doc source directory.
+# Instead, it is supposed to be copied to the target doc directory.
+
+SUF=dit
+PRINT=dis
+NROFF=troff
 MS=-ms
+OPR=dip
 
 RESFILES= \
 	toolkit.$(SUF) install.$(SUF) em.$(SUF) ack.$(SUF) v7bugs.$(SUF) \
 	peep.$(SUF) cg.$(SUF) ncg.$(SUF) regadd.$(SUF) LLgen.$(SUF) \
-	basic.$(SUF) crefman.$(SUF) pcref.$(SUF) val.$(SUF) \
+	basic.$(SUF) crefman.$(SUF) pascal.$(SUF) pcref.$(SUF) val.$(SUF) \
+	ansi_C.$(SUF) \
 	6500.$(SUF) i80.$(SUF) z80.$(SUF) top.$(SUF) ego.$(SUF) \
-	m68020.$(SUF) occam.$(SUF)
+	m68020.$(SUF) occam.$(SUF) m2ref.$(SUF) ceg.$(SUF) nopt.$(SUF) \
+	sparc.$(SUF) int.$(SUF) lint.$(SUF)
 
-.SUFFIXES: .doc .$(SUF)
+.SUFFIXES: .doc .$(SUF) .lpr .out
 
 .doc.$(SUF):
 		$(NROFF) $(MS) $< > $@
 
-crefman.$(SUF):	crefman.doc
-		$(EQN) crefman.doc | $(NROFF) $(MS) >$@
+# directly to the printer:
+.doc.lpr:
+		$(NROFF) $(MS) $< | $(OPR)
+
+# to standard output
+.doc.out:
+		@$(NROFF) $(MS) $<
+
+# Exceptions, to be run without -ms
+
 v7bugs.$(SUF):	v7bugs.doc
 		$(NROFF) v7bugs.doc >$@
-install.$(SUF):	install.doc
-		$(TBL) install.doc | $(NROFF) $(MS) >$@
+
+v7bugs.lpr:	v7bugs.doc
+		$(NROFF) v7bugs.doc | $(OPR)
+
+v7bugs.out:	v7bugs.doc
+		@$(NROFF) v7bugs.doc
+
 pcref.$(SUF):	pcref.doc
 		$(NROFF) pcref.doc >$@
+
+pcref.lpr:	pcref.doc
+		$(NROFF) pcref.doc | $(OPR)
+
+pcref.out:	pcref.doc
+		@$(NROFF) pcref.doc
+
 val.$(SUF):	val.doc
 		$(NROFF) val.doc >$@
-6500.$(SUF):	6500.doc
-		$(TBL) 6500.doc | $(NROFF) $(MS) >$@
-LLgen.doc:	LLgen.X
-LLgen.X:
-		cd LLgen; make "EQN="$(EQN) "TBL="$(TBL) "REFER="$(REFER)
-top.doc:	top.X
-top.X:
-		cd top; make "EQN="$(EQN) "TBL="$(TBL) "REFER="$(REFER)
-occam.doc:	occam.X
-occam.X:
-		cd occam; make "PIC="$(PIC) "TBL="$(TBL) "EQN="$(EQN)
-ego.doc:	ego.X
-ego.X:
-		cd ego; make "REFER="$(REFER)
-em.$(SUF):	em.X
-em.X:
-		cd em; make "TBL="$(TBL) "NROFF="$(NROFF) "SUF="$(SUF)
 
-install cmp:
+val.lpr:	val.doc
+		$(NROFF) val.doc | $(OPR)
 
-distr:		install.doc
-		tbl install.doc | nroff -Tlp $(MS) >install.pr
+val.out:	val.doc
+		@$(NROFF) val.doc
 
 pr:
-		@make "SUF="$(SUF) "NROFF="$(NROFF) "EQN="$(EQN) "TBL="$(TBL) \
-			"PIC="$(PIC) "MS="$(MS) \
+		@make "SUF="$(SUF) "NROFF="$(NROFF) "MS="$(MS) \
 			$(RESFILES) >make.pr.out 2>&1
 		@$(PRINT) $(RESFILES)
 
+# The 'opr' entry creates a lot of paper ... but the user must be able
+# to write the doc directory. I hope that this limits the users of
+# this entry to persons that know what they are doing.
 opr:
-		make pr | opr
+		@make "SUF="$(SUF) "NROFF="$(NROFF) "MS="$(MS) $(RESFILES) 
+		$(OPR) $(RESFILES)
 
 clean:
-		-rm -f *.old $(RESFILES) *.t *.out LLgen.doc top.doc \
-			occam.doc ego.doc
+		-rm -f $(RESFILES)
+
+# The distr entry is only used when making a distribution tree.
+# It makes a version of the installation manual, suitable for a simple
+# line printer.
+distr:		install.doc
+		tbl install.doc | nroff -Tlp $(MS) >install.pr

doc/READ_ME

@@ -0,0 +1,8 @@
+Some of these documents use a font called CW.
+If this font is not available, reference to it can be changed with
+a sed-script like
+	s/\.ft CW/.ft yourfont/
+	s/\\f(CW/\\fyourfont/g
+	s/^.fp\(.*\)CW$/.fp\1yourfont/
+However, the font must be a constant-width font for the documents to look
+reasonable.

doc/ack.doc

@@ -1,4 +1,4 @@
-.\" $Header$
+.\" $Id$
 .nr PD 1v
 .tr ~
 .TL
@@ -23,7 +23,7 @@ source file.
 Each transformation table entry tells which input suffixes are
 allowed and what suffix/name the output file has.
 When the output file does not already satisfy the request of the
-user, with the flag \fB\-c.suffix\fP, the table is scanned
+user (indicated with the flag \fB\-c.suffix\fP), the table is scanned
 starting with the next transformation in the table for another
 transformation that has as input suffix the output suffix of
 the previous transformation.
@@ -57,7 +57,7 @@ The way the backend table name is determined is more
 convoluted.
 .br
 First, when the last filename in the program call name is not
-one of \fIack\fP, \fIcc\fP, \fIacc\fP, \fIpc\fP or \fIapc\fP,
+one of \fIack\fP or the front-end call-names,
 this filename is used as the backend description name.
 Second, when the \fB\-m\fP is present the \fB\-m\fP is chopped of this
 flag and the rest is used as the backend description name.
@@ -75,7 +75,7 @@ At the moment of writing this document, the descriptions
 included are: pdp, fe, i86, m68k2, vax2 and int.
 The name of a description is first searched for internally,
 then in lib/descr/\fIname\fP, then in
-lib/\fIname\fP/descr, band finally in the current
+lib/\fIname\fP/descr, and finally in the current
 directory of the user.
 .NH
 Using the description file
@@ -226,7 +226,7 @@ The mapflags are used to grab flags given to \fIack\fP and
 pass them on to a specific transformation.
 This feature uses a few simple pattern matching and replacement
 facilities.
-Multiple occurences of this keyword are allowed.
+Multiple occurrences of this keyword are allowed.
 This text following the keyword is
 subjected to backslashing.
 The keyword is followed by a match expression and a variable
@@ -254,7 +254,7 @@ preserved.
 The identifier LNAME is used in conjunction with the scanning of
 \fB\-l\fP flags.
 The value assigned to LNAME is used to replace the flag.
-The example further on shows the use all this.
+The example further on shows the use of all this.
 .IP \fIargs\fP
 .br
 The keyword is followed by the program call arguments.
@@ -272,7 +272,17 @@ This keyword indicates that the transformation reads from standard input.
 This keyword indicates that the transformation writes on standard output.
 .IP \fIoptimizer\fP
 .br
-This keyword indicates that this transformation is an optimizer.
+The presence of this keyword indicates that this transformation is an optimizer.
+It can be followed by a number, indicating the "level" of the
+optimizer (see description of the -O option in the ack(1ACK) manual page).
+.IP \fIpriority\fP
+.br
+This \-~optional~\- keyword is followed by a number. Positive priority means
+that the transformation is likely to be used, negative priority means that
+the transformation is unlikely to be used.
+Priorities can also be set with a ack(1ACK) command line option.
+Priorities come in handy when there are several implementations of a
+certain transformation. They can then be used to select a default one.
 .IP \fIlinker\fP
 .br
 This keyword indicates that this transformation is the linker.
@@ -301,7 +311,7 @@ call name (acc, cc, apc or pc) or by the \fB\-.suffix\fP flag.
 .IP \fIneed\fP
 .br
 This \-~optional~\- keyword indicates that the rest of the line must be
-concatenated to the NEEDS variable.
+concatenated to the HEAD and TAIL variables.
 This is done once for every transformation used or indicated
 by one of the program call names mentioned above or indicated
 by the \fB\-.suffix\fP flag.
@@ -319,7 +329,7 @@ transformations.
 \fIAck\fP sets the variable EM to the home directory of the
 Amsterdam Compiler Kit.
 The variable SOURCE is set to the name of the argument that is currently
-being massaged, this is usefull for debugging.
+being massaged, this is useful for debugging.
 The variable SUFFIX is set to the suffix of the argument that is
 currently being massaged.
 .br
@@ -353,7 +363,7 @@ name cpp	# the C-preprocessor
 	    \-DEM_SSIZE={s} \-DEM_LSIZE={l} \-DEM_FSIZE={f} \-DEM_DSIZE={d} <
 		# The arguments are: first the \-[IUD]...
 		#  then the include dir's for this machine
-		#  then the NAME and size valeus finally
+		#  then the NAME and size values finally
 		#  followed by the input file name
 	stdout	# Output on stdout
 	prep is	# Is preprocessor
@@ -391,7 +401,11 @@ var p=2	# pointersize 2
 var s=2	# short size 2
 var l=4	# long size 4
 var f=4	# float size 4
-var d=8	# dou<EFBFBD><EFBFBD>XY<17>H<EFBFBD>\<5C>و<19>[H<1B>e startoff
+var d=8	# double size 8
+var M=em22
+var NAME=em22	# for cpp (NAME=em22 results in #define em22 1)
+var LIB=lib/{M}/tail_	# part of file name for libraries
+var RT=lib/{M}/head_	# part of file name for run-time startoff
 var SIZE_FLAG=\-sm	# default internal table size flag
 var INCLUDES=\-I{EM}/include	# use {EM}/include for #include files
 name asld	# Assembler/loader
@@ -416,15 +430,15 @@ name asld	# Assembler/loader
 end
 .DE
 
-The command \fIack \-mint \-v \-v \-I../h \-L \-ly prog.c\fP
+The command \fIack \-mem22 \-v \-v \-I../h \-L \-ly prog.c\fP
 would result in the following
 calls (with exec(II)):
 .DS X
 .ta 4n
-1)	/lib/cpp \-I../h \-I/usr/em/include \-Dint22 \-DEM_WSIZE=2 \-DEM_PSIZE=2 \e
+1)	/lib/cpp \-I../h \-I/usr/em/include \-Dem22 \-DEM_WSIZE=2 \-DEM_PSIZE=2 \e
 	    \-DEM_SSIZE=2 \-DEM_LSIZE=4 \-DEM_FSIZE=4 \-DEM_DSIZE=8 prog.c
 2)	/usr/em/lib/em_cem \-Vw2i2p2f4s2l4d8 \-l
-3)	/usr/em/lib/em_ass \-sm /usr/em/mach/int/lib/head_cc \-o e.out prog.k
-	/usr/em/mach/int/lib/tail_y /usr/em/mach/int/lib/tail_cc.1s
-	/usr/em/mach/int/lib/tail_cc.2g /usr/em/mach/int/lib/tail_mon
+3)	/usr/em/lib/em_ass \-sm /usr/em/lib/em22/head_cc \-o e.out prog.k
+	/usr/em/lib/em22/tail_y /usr/em/lib/em22/tail_cc.1s
+	/usr/em/lib/em22/tail_cc.2g /usr/em/lib/em22/tail_mon
 .DE

doc/ansi_C.doc

@@ -0,0 +1,365 @@
+.de NS
+.sp
+.in 0
+\\fBANS \\$1:\\fP
+..
+.TL
+Amsterdam Compiler Kit-ANSI C compiler compliance statements
+.AU 
+Hans van Eck
+.AI
+Dept. of Mathematics and Computer Science
+Vrije Universiteit
+Amsterdam, The Netherlands
+.PP
+This document specifies the implementation-defined behaviour of the ANSI-C
+front end of the Amsterdam Compiler Kit as required by ANS X3.159-1989.  Since
+the implementation-defined behaviour sometimes depends on the machine
+compiling on or for, some items will be left unspecified in this
+document\(dg.
+.FS
+\(dg when cross-compiling, run-time behaviour may be different from
+compile-time behaviour
+.FE
+The compiler assumes that it runs on a UNIX system.
+.NS A.6.3.1
+.IP -
+Diagnostics are placed on the standard error output.  They have the
+following specification:
+.br
+"<file>", line <nr>: [(<class>)] <diagnostic>
+.br
+There are three classes of diagnostics: "error", "strict" and "warning".
+When the class is "error", the <class> is absent.
+.br
+The class "strict" is used for violations of the standard which are
+not severe enough to stop compilation.  An example is the the occurrence
+of non white-space after an '#else' or '#endif' pre-processing
+directive.  The class "warning" is used for legal but dubious
+constructions.  An example is overflow of constant expressions.
+.NS A.6.3.2
+.IP -
+The function 'main' can have two arguments.  The first argument is an
+integer specifying the number of arguments on the command line.  The second
+argument is a pointer to an array of pointers to the arguments (as
+strings).
+.IP -
+Interactive devices are terminals.
+.NS A.6.3.3
+.IP -
+The number of significant characters is an option.  By default it is 64.
+There is a distinction between upper and lower case.
+.NS A.6.3.4
+.IP -
+The compiler assumes ASCII-characters in both the source and execution
+character set.
+.IP -
+There are no multi-byte characters.
+.IP -
+There 8 bits in a character.
+.IP -
+Character constants with values that can not be represented in 8 bits
+are truncated.
+.IP -
+Character constants that are more than 1 character wide will have the
+first character specified in the least significant byte.
+.IP -
+The only supported locale is "C".
+.IP -
+A plain 'char' has the same range of values as 'signed char'.
+.NS A.6.3.5
+.IP -
+The compiler assumes that it works on and compiles for a
+2-complement binary-number system.  Shorts will use 2 bytes and longs
+will use 4 bytes.  The size of integers are machine dependent.
+.IP -
+Converting an integer to a shorter signed integer is implemented by
+ignoring the high-order byte(s) of the former.
+Converting a unsigned integer to a signed integer of the same type is
+only done in administration.  This means that the bit-pattern remains
+unchanged.
+.IP -
+The result of bitwise operations on signed integers are what can be
+expected on a 2-complement machine.
+.IP -
+If either operand is negative, whether the result of the / operator is the
+largest integer less than or equal to the algebraic quotient or the
+smallest integer greater than or equal to the algebraic quotient is machine
+dependent, as is the sign of the result of the % operator.
+.IP -
+The right-shift of a negative value is negative.
+.NS A.6.3.6
+.IP -
+The representation of floating-point values is machine-dependent.
+When native floating-point is not present an IEEE-emulation is used.
+The compiler uses high-precision floating-point for constant folding.
+.IP -
+Truncation is always to the nearest floating-point number that can
+be represented.
+.NS A.6.3.7
+.IP -
+The type returned by the sizeof-operator (also known as size_t)
+is 'unsigned int'.  This is done for backward compatibility reasons.
+.IP -
+Casting an integer to a pointer or vice versa has no effect in
+bit-pattern when the sizes are equal.  Otherwise the value will be
+truncated or zero-extended (depending on the direction of the
+conversion and the relative sizes).
+.IP -
+When a pointer is as large as an integer, the type of a 'ptrdiff_t' will
+be 'int'.  Otherwise the type will be 'long'.
+.NS A.6.3.8
+.IP -
+Since the front end has only limited control over the registers, it can
+only make it more likely that variables that are declared as
+registers also end up in registers.  The only things that can possibly be
+put into registers are : 'int', 'long', 'float', 'double', 'long double'
+and pointers.
+.NS A.6.3.9
+.IP -
+When a member of a union object is accessed using a member of a
+different type, the resulting value will usually be garbage.  The
+compiler makes no effort to catch these errors.
+.IP -
+The alignment of types is a compile-time option.  The alignment of
+a structure-member is the alignment of its type.  Usually, the
+alignment is passed on to the compiler by the 'ack' program.  When a
+user wants to do this manually, he/she should be prepared for trouble.
+.IP -
+A "plain" 'int' bit-field is taken as a 'signed int'.  This means that
+a field with a size of 1 bit can only store the values 0 and -1.
+.IP -
+The order of allocation of bit-fields is a compile-time option.  By
+default, high-order bits are allocated first.
+.IP -
+An enum has the same size as a "plain" 'int'.
+.NS A.6.3.10
+.IP -
+An access to a volatile declared variable is done by just mentioning
+the variable.  E.g. the statement "x;" where x is declared volatile,
+constitutes an access.
+.S A.6.3.11
+.IP -
+There is no fixed limit on the number of declarators that may modify an
+arithmetic, structure or union type, although specifying too many may
+cause the compiler to run out of memory.
+.NS A.6.3.12
+.IP -
+The maximum number of cases in a switch-statement is in the order of
+1e9, although the compiler may run out of memory somewhat earlier.
+.NS A.6.3.13
+.IP -
+Since both the pre-processor and the compiler assume ASCII-characters, 
+a single character constant in a conditional-inclusion directive
+matches the same value in the execution character set.
+.IP -
+The pre-processor recognizes -I... command-line options.  The
+directories thus specified are searched first.  After that, depending on the
+command that the preprocessor is called with, machine/system-dependant
+directories are searched.  After that, ~em/include/_tail_ac and
+/usr/include are visited.
+.IP -
+Quoted names are first looked for in the directory in which the file
+which does the include resides.
+.IP -
+The characters in a h- or q- char-sequence are taken to be UNIX
+paths.
+.IP -
+Neither the compiler nor the preprocessor know any pragmas.
+.IP -
+Since the compiler runs on UNIX, __DATE__ and __TIME__ will always be
+defined.
+.NS A.6.3.14
+.IP -
+NULL is defined as ((void *)0).  This in order to flag dubious
+constructions like "int x = NULL;".
+.IP -
+The diagnostic printed by 'assert' is as follows:
+.ti +4n
+"Assertion "<expr>" failed, file "<file>", line <line>",
+.br
+where <expr> is the argument to the assert macro, printed as string.
+(the <file> and <line> should be clear)
+.KS
+.IP -
+The sets for character test macros.
+.TS
+l l.
+name:	set:
+isalnum()	0-9A-Za-z
+isalpha()	A-Za-z
+iscntrl()	\e000-\e037\e177
+islower()	a-z
+isupper()	A-Z
+isprint()	<space>-~ (== \e040-\e176)
+.TE
+.KE
+As an addition, there is an isascii() macro, which tests whether a character
+is an ascii character.  Characters in the range from \e000 to \e177 are ascii
+characters.
+.KS
+.IP -
+The behaviour of mathematic functions on domain error:
+.TS
+l c
+l n.
+name:	returns:
+asin()	0.0
+acos()	0.0
+atan2()	0.0
+fmod()	0.0
+log()	-HUGE_VAL
+log10()	-HUGE_VAL
+pow()	0.0
+sqrt()	0.0
+.TE
+.KE
+.IP -
+Underflow range errors do not cause errno to be set.
+.IP -
+The function fmod() returns 0.0 and sets errno to EDOM when the second
+argument is 0.0.
+.IP -
+The set of signals for the signal() function depends on the UNIX-system
+which the compiler is compiling for.  The default handling, semantics
+and behaviour of these signals are those specified by the operating
+system vendor.  The default handling is not reset when SIGILL is
+received.
+.IP -
+A text-stream need not end in a new-line character.
+.IP -
+White space characters before a new-line appear when read in.
+.IP -
+There may be any number of null characters appended to a binary
+stream.
+.IP -
+The file position indicator of an append mode stream is initially
+positioned at the beginning of the file.
+.IP -
+A write on a text stream does not cause the associated file to be
+truncated beyond that point.
+.IP -
+The buffering intended by the standard is fully supported.
+.IP -
+A zero-length file actually exists.
+.IP -
+A file name can consist of any character, except for the '\e0' and
+the '/'.
+.IP -
+A file can be open multiple times.
+.IP -
+When a remove() is done on an open file, reading and writing behave
+just as can be expected from a non-removed file.  When the associated
+stream is closed, all written data will be lost.
+.IP -
+When a file exists prior to a call to rename(), the behaviour is that
+of the underlying UNIX system.  Normally, the call would fail.
+.IP -
+The %p conversion in fprintf() has the same effect as %#x or %#lx,
+depending on the sizes of pointer and integer.
+.IP -
+The %p conversion in fscanf() has the same effect as %x or %lx,
+depending on the sizes of pointer and integer.
+.IP -
+A - character that is neither the first nor the last character in the
+scanlist for %[ conversion is taken to be a range indicator.  When the
+first character has a higher ASCII-value than the second, the - will
+just be put into the scanlist.
+.IP -
+The value of errno when fgetpos() or ftell() failed is that of lseek().
+This means:
+.RS
+.IP "EBADF \-" 10
+when the stream is not valid
+.IP "ESPIPE \-"
+when fildes is associated with a pipe (and on some systems: sockets)
+.IP "EINVAL \-"
+the resulting file pointer would be negative
+.RE
+.LP
+.IP -
+The messages generated by perror() depend on the value of errno.
+The mapping of errors to strings is done by strerror().
+.IP -
+When the requested size is zero, malloc(), calloc() and realloc()
+return a null-pointer.
+.IP -
+When abort() is called, output buffers will be flushed.  Temporary files
+(made with the tmpfile() function) will have disappeared when SIGABRT
+is not caught or ignored.
+.IP -
+The exit() function returns the low-order eight bits of its argument
+to the environment.
+.IP -
+The predefined environment names are controlled by the user.
+Setting environment variables is done through the putenv() function.
+This function accepts a pointer to char as its argument.
+To set f.i. the environment variable TERM to a230 one writes
+.ti +4n
+putenv("TERM=a230");
+.br
+The argument to putenv() is stored in an internal table, so malloc'ed
+strings can not be freed until another call to putenv() (which sets the
+same environment variable) is made.  The function returns 1 if it fails,
+0 otherwise.
+.LP
+.IP -
+The argument to system is passed as argument to /bin/sh -c.
+.IP -
+The strings returned by strerror() depend on errno in the following
+way:
+.TS
+l l.
+errno	string
+0	"Error 0",
+EPERM	"Not owner",
+ENOENT	"No such file or directory",
+ESRCH	"No such process",
+EINTR	"Interrupted system call",
+EIO	"I/O error",
+ENXIO	"No such device or address",
+E2BIG	"Arg list too long",
+ENOEXEC	"Exec format error",
+EBADF	"Bad file number",
+ECHILD	"No children",
+EAGAIN	"No more processes",
+ENOMEM	"Not enough core",
+EACCES	"Permission denied",
+EFAULT	"Bad address",
+ENOTBLK	"Block device required",
+EBUSY	"Mount device busy",
+EEXIST	"File exists",
+EXDEV	"Cross-device link",
+ENODEV	"No such device",
+ENOTDIR	"Not a directory",
+EISDIR	"Is a directory",
+EINVAL	"Invalid argument",
+ENFILE	"File table overflow",
+EMFILE	"Too many open files",
+ENOTTY	"Not a typewriter",
+ETXTBSY	"Text file busy",
+EFBUG	"File too large",
+ENOSPC	"No space left on device",
+ESPIPE	"Illegal seek",
+EROFS	"Read-only file system",
+EMLINK	"Too many links",
+EPIPE	"Broken pipe",
+EDOM	"Math argument",
+ERANGE	"Result too large"
+.TE
+everything else causes strerror() to return "unknown error"
+.IP -
+The local time zone is per default MET (GMT + 1:00:00).  This can be
+changed through the TZ environment variable, or by some changes in the
+sources.
+.IP -
+The clock() function returns the number of ticks since process
+startup.
+.SH
+References
+.IP [1]
+ANS X3.159-1989
+.I
+American National Standard for Information Systems -
+Programming Language C
+.R

doc/basic.doc

@@ -1,5 +1,5 @@
-.\" $Header$
-.TL
+.\" $Id$ 
+.TL 
 .de Sy
 .LP
 .IP \fBsyntax\fR 10
@@ -13,10 +13,17 @@
 The ABC compiler
 .AU
 Martin L. Kersten
+Gert-Jan Akkerman
+Marcel Worring
+Edo Westerhuis
+Frans Kunst
+Ronnie Lachniet
 .AI
 Department of Mathematics and Computer Science.
 .br
-Vrije Universiteit
+Free University
+.br
+Amsterdam
 .AB
 This manual describes the 
 programming language BASIC and its compiler
@@ -28,35 +35,40 @@ INTRODUCTION.
 The BASIC-EM compiler is an extensive implementation of the
 programming language BASIC.
 The language structure and semantics are modelled after the 
-BASIC interpreter/compiler of Microsoft (tr), a detailed comparison
+BASIC interpreter/compiler of Microsoft (tr), a short comparison
 is provided in appendix A.
 .LP
 The compiler generates code for a virtual machine, the EM machine
-[[ACM, etc]]
+[[ACM, etc]].
 Using EM as an intermediate machine results in a highly portable
 compiler and BASIC code.
+.br
 The drawback of EM is that it does not directly reflect one particular
-hardware design, which means that many of 
-the low level operations available within 
-BASIC are ill-defined or even inapplicable.
+hardware design, which means that many of the low level operations available 
+within BASIC are ill-defined or even inapplicable.
 To mention a few, the peek and poke instructions are likely
 to be behave errorneous, while line printer and tapedeck 
 primitives are unknown.
 .LP
 This manual is divided into three chapters.
-The first chapter discusses the general language syntax and semantics.
-Chapter two describes the statements available in BASIC-EM.
-Chapter 3 describes the predefined functions,
-ordered alphabetically.
-Appendix A discusses the differences with
-Microsoft BASIC. Appendix B describes all reserved symbols.
-Appendix C lists the error messages in use.
+.br
+Chapter 1 discusses the general language syntax and semantics.
+.br
+Chapter 2 describes the statements available in BASIC-EM.
+.br
+Chapter 3 describes the predefined functions, ordered alphabetically.
+.LP
+Appendix A discusses the differences with Microsoft BASIC. 
+.br
+Appendix B describes all reserved symbols.
+.LP
+.LP
 .SH
 SYNTAX NOTATION
 .LP
 The conventions for syntax presentation are as follows:
 .IP CAPS 10
-Items are reserved words, must be input as shown
+Items are reserved words, must be input as shown.
 .IP <> 10
 Items in lowercase letters enclosed in angular brackets
 are to be supplied by the user.
@@ -71,18 +83,19 @@ must be chosen.
 Vertical bars separate the choices within braces.
 .LP
 All punctuation must be included where shown.
+.bp
 .NH 1
 GENERAL INFORMATION
 .LP
 The BASIC-EM compiler is designed for a UNIX based environment.
-It accepts a text file with your BASIC program (suffix .b) and generates
+It accepts a text file with a BASIC program (suffix .b) and generates
 an executable file, called a.out.
 .NH 2
 LINE FORMAT
 .LP
 A BASIC program consists of a series of lines, starting with a 
-positive line number in the range 0 to 65529.
-A line may consists of more then one physical line on your terminal, but must
+positive line number in the range 0 to 32767.
+A line may consists of more than one physical line on a terminal, but
 is limited to 1024 characters.
 Multiple BASIC statements may be placed on a single line, provided
 they are separated by a colon (:).
@@ -105,19 +118,24 @@ character set enclosed by double quotation marks.
 Numeric constants are positive or negative numbers, grouped into
 five different classes.
 .IP "a) integer constants" 25
+.br
 Whole numbers in the range of -32768 and 32767. Integer constants do
 not contain decimal points.
 .IP "b) fixed point constants" 25
+.br
 Positive or negative real numbers, i.e. numbers with a decimal point.
 .IP "c) floating point constants" 25
+.br
 Real numbers in scientific notation. A floating point constant
 consists of an optional signed integer or fixed point number
 followed by the letter E (or D) and an optional signed integer
 (the exponent).
 The allowable range of floating point constants is 10^-38 to 10^+38.
 .IP "d) Hex constants" 25
+.br
 Hexadecimal numbers, denoted by the prefix &H.
-.IP "d) Octal constants" 25
+.IP "e) Octal constants" 25
+.br
 Octal numbers, denoted by the prefix &O.
 .NH 2
 VARIABLES
@@ -128,7 +146,7 @@ Before a variable is assigned its value is assumed to be zero.
 .br
 Variable names are composed of letters, digits or the decimal point,
 starting with a letter. Up to 40 characters are significant.
-A variable name be be followed by any of the following  type 
+A variable name can be followed by any of the following  type 
 declaration characters:
 .IP % 5
 Defines an integer variable
@@ -139,11 +157,7 @@ Defines a double precision variable
 .IP $ 5
 Defines a string variable.
 .LP
-NOTE: Two variables with the same name but different type is
-considered illegal.
-.LP
-Beside single valued variables, values may be grouped
-into tables or arrays.
+Beside single valued variables, values may be grouped into tables or arrays.
 Each element in an array is referenced by the array name and an index,
 such a variable is called a subscripted variable.
 An array has as many subscripts as there are dimensions in the array,
@@ -154,14 +168,25 @@ function.
 .br
 A variable name may not be a reserved word nor the name 
 of a predefined function.
-A list of all reserved identifiers is included as Appendix ?.
+A list of all reserved identifiers is included as Appendix B.
+.LP
+NOTES: 
+.br
+Two variables with the same name but different type is
+considered illegal.
+.br
+The type of a variable without typedeclaration-character is set,
+at it's first occurence in the program, 
+to the defaulttype which is (in this implementation) double precision.
+.br
+Multi-dimensional array's must be declared before use (see 
+DIM-statement ).
+.br
+BASIC-EM differs from Microsoft BASIC in supporting floats in one precision
+only (due to EM), eg doubles and floats have the same precision.
 .NH 2
 EXPRESSIONS
 .LP
-BASIC-EM differs from Microsoft BASIC in supporting floats in one precision
-only (due to EM).
-All floating point constants have the same precision, i.e. 16 digits.
-.LP
 When necessary the compiler will convert a numeric value from
 one type to another.
 A value is always converted to the precision of the variable it is assigned
@@ -179,9 +204,9 @@ Arithmetic
 .LP
 The arithmetic operators in order of precedence,a re:
 .DS L
-\^		Exponentiation
+^		Exponentiation
 -		Negation
-*,/,\\,MOD	Multiplication, Division, Remainder
+*,/,\\\\\\\\,MOD	 Multiplication, Division, Remainder
 +,-		Addition, Substraction
 .DE
 The operator \\\\ denotes integer division, its operands are rounded to
@@ -189,7 +214,7 @@ integers before the operator is applied.
 Modulus arithmetic is denoted by the operator MOD, which yields the
 integer value that is the remainder of an integer division.
 .br
-The order in which operators are performed can be changec with parentheses.
+The order in which operators are performed can be changed with parentheses.
 .SH
 Relational
 .LP
@@ -210,7 +235,7 @@ then the arithmetic operators.
 Logical
 .LP
 The logical operators performs tests on multiple relations, bit manipulations,
-or Boolean operations.
+or boolean operations.
 The logical operators returns a bitwise result ("true" or "false").
 In an expression, logical operators are performed after the relational and
 arithmetic operators.
@@ -241,6 +266,7 @@ ERROR MESSAGES
 .LP
 The occurence of an error results in termination of the program
 unless an ON....ERROR statement has been encountered.
+.bp
 .NH 1
 B-EM STATEMENTS
 .LP
@@ -266,7 +292,7 @@ The argument list consist of (subscripted) variables.
 The BASIC compiler pushes the address of the arguments on the stack in order
 of encounter.
 .RM
-Not yet available
+Not yet available.
 .NH 2
 CLOSE
 .Sy
@@ -274,7 +300,7 @@ CLOSE [[#]<file number>[,[#]<file number...>]]
 .PU
 To terminate I/O on a disk file.
 <file number> is the number associated with the file 
-when it was OPENed (See OPEN). Ommission of parameters results in closing
+when it was OPENed (See OPEN-statement). Ommission of parameters results in closing
 all files.
 .sp
 The END statement and STOP statement always issue a CLOSE of
@@ -334,14 +360,15 @@ DIM <list of subscripted variable>
 .PU
 The DIM statement allocates storage for subscripted variables.
 If an undefined subscripted variable is used 
-the maximum value of the array subscript(s) is assumed to be 10.
-A subscript out of range is signalled by the program (when RCK works)
+the maximum value of the array subscript is assumed to be 10.
+A subscript out of range is signalled by the program (when ACK works)
 The minimum subscript value is 0, unless the OPTION BASE statement has been
 encountered.
 .sp
 All variables in a subscripted variable are initially zero.
 .sp
-BUG. Multi-dimensional arrays MUST be defined.
+BUGS. Multi-dimensional arrays MUST be defined. Subscript out of range is
+left unnotified.
 .NH 2
 END
 .Sy
@@ -351,6 +378,10 @@ END terminates a BASIC program and returns to the UNIX shell.
 An END statement at the end of the BASIC program is optional.
 .NH 2
 ERR and ERL
+.Sy
+<identifier name>= ERR
+.br
+<identifier name>= ERL
 .PU
 Whenever an error occurs the variable ERR contains the
 error number and ERL the BASIC line where the error occurred.
@@ -362,10 +393,9 @@ ERROR
 ERROR <integer expression>
 .PU
 To simulate the occurrence of a BASIC error.
-To define your own error code use a value not already in
+To define a private error code a value must be used that is not already in
 use by the BASIC runtime system.
-The list of error messages currently in use 
-can be found in appendix B.
+The list of error messages currently in use can be found in appendix B.
 .NH 2
 FIELD
 .PU
@@ -383,18 +413,15 @@ The FOR statements allows a series of statements to be performed
 repeatedly. <variable> is used as a counter. During the first
 execution pass it is assigned the value <low>,
 an arithmetic expression. After each pass the counter
-is incremented with the step size <size>, an expression.
+is incremented (decremented) with the step size <size>, an expression.
 Ommission of the step size is intepreted as an increment of 1.
+.br
 Execution of the program lines specified between the FOR and the NEXT
-statement is terminated as soon as <low> is greater than <high>
+statement is terminated as soon as <low> is greater (less) than <high>
 .sp
 The NEXT statement is labeled with the name(s) of the counter to be
 incremented.
 .sp
-The body of the FOR statement is skipped when the initial value of the
-loop times the sign of the step exceeds the value of the highest value
-times the sign of the step.
-.sp
 The variables mentioned in the NEXT statement may be ommitted, in which case
 the variable of increment the counter of the most recent FOR statement.
 If a NEXT statement is encountered before its corresponding FOR statement,
@@ -408,7 +435,7 @@ To be implemented.
 .NH 2
 GOSUB...RETURN
 .Sy
-GOSUB <line number
+GOSUB <line number>
   ...
 .br
 RETURN
@@ -512,7 +539,7 @@ LET
 [LET]<variable>=<expression>
 .PU
 To assign  the value of an expression to a (subscribted) variable.
-The type convertions as dictated in section 1.X apply.
+The type convertions as dictated in chapter 1 apply.
 .NH 2
 LINE INPUT
 .Sy
@@ -558,18 +585,30 @@ Subsequent errors result in an error message and program termination.
 ON...GOSUB and ON ...GOTO
 .Sy
 ON <expression> GOSUB <list of line numbers>
+.br
 ON <expression> GOTO <list of line numbers>
 .PU
 To branch to one of several specified line numbers or subroutines, based
 on the result of the <expression>. The list of line numbers are considered
 the first, second, etc alternative. Branching to the first occurs when
 the expression evaluates to one, to the second alternative on two, etc.
-If the value of the expression in zero or greater than the number of alternatives, processing continues at the first statement following the ON..GOTO 
+If the value of the expression is zero or greater than the number of alternatives, processing continues at the first statement following the ON..GOTO 
 (ON GOSUB) statement.
+.sp
 When the expression results in a negative number the 
 an "Illegal function call" error occurs.
+.sp
+BUG If the value of the expression is zero or greater than the number of 
+alternatives, processing does NOT continue at the first statement 
+following the ON..GOTO (ON GOSUB) statement.
 .NH 2
 OPEN
+.Sy
+OPEN {"i" | "o" | "r" } , [#]<file number> , <file-name>
+.PU
+To open <file-name> (filename should be quoted) for input/reading or output.
+If file is not opened for output it has to be existent, otherwise an 
+"file not found" error will occur.
 .NH 2
 OPTION BASE
 .Sy
@@ -587,7 +626,21 @@ because it requires full understanding of both
 the implementation of the Amsterdam
 Compiler Kit and the hardware characteristics.
 .NH 2
-PRINT [USING]
+PRINT 
+.Sy
+PRINT <list of variables and/or constants>
+.PU
+To print constants or the contents of variables on the terminal-device. 
+If the variables or constants are seperated by comma's the values will 
+be printed seperated by tabs. 
+If the variables or constants are seperated by semi-colon's the values 
+will be printed without spaces in between. 
+The new-line generated at the end of the print-statement can be suppressed by 
+a semi-colon at the end of list of variables or constants.
+.NH 2
+PRINT USING
+.PU
+To be implemented
 .NH 2
 PUT
 .PU
@@ -608,7 +661,8 @@ READ <list of variables>
 .PU
 To read values from the DATA statements and assign them to variables.
 The type of the variables should match to the type of the items being read,
-otherwise a "Syntax error" occurs.
+otherwise a "Syntax error" occurs. If all data is read the message "Out of
+data" will be displayed.
 .NH 2
 REM
 .Sy
@@ -651,6 +705,8 @@ SWAP
 SWAP <variable>,<variable>
 .PU
 To exchange the values of two variables.
+.sp
+BUG. Strings cannot be swapped !
 .NH 2
 TRON/TROFF
 .Sy
@@ -684,118 +740,121 @@ WRITE #<file number> ,<list of expressions>
 .PU
 To write a sequential data file, being opened with the "O" mode.
 The values are being writting using the DATA statements layout conventions.
+.bp
 .NH
 FUNCTIONS
 .LP
-.IP ABS(X) 12
+.IP ABS(X) 25
 Returns the absolute value of expression X
-.IP ASC(X$) 12
+.IP ASC(X$) 25
 Returns the numeric value of the first character of the string.
 If X$ is not initialized an "Illegal function call" error
 is returned.
-.IP ATN(X) 12
+.IP ATN(X) 25
 Returns the arctangent of X in radians. Result is in the range
 of -pi/2 to pi/2.
-.IP CDBL(X) 12
+.IP CDBL(X) 25
 Converts X to a double precision number.
-.IP CHR$(X) 12
+.IP CHR$(X) 25
 Converts the integer value X to its ASCII character. 
-X must be in the range of 0 to 127.
+X must be in the range of 0 to 257.
 It is used for cursor addressing and generating bel signals.
-.IP CINT(X) 12
+.IP CINT(X) 25
 Converts X to an integer by rounding the fractional portion.
 If X is not in the range -32768 to 32767 an "Overflow"
 error occurs.
-.IP COS(X) 12
+.IP COS(X) 25
 Returns the cosine of X in radians.
-.IP CSNG(X) 12
-Converts X to a double precision number.
-.IP CVI(<2-bytes>) 12
+.IP CSNG(X) 25
+Converts X to a single precision number.
+.IP CVI(<2-bytes>) 25
 Convert two byte string value to integer number.
-.IP CVS(<4-bytes>) 12
+.IP CVS(<4-bytes>) 25
 Convert four byte string value to single precision number.
-.IP CVD(<8-bytes>) 12
+.IP CVD(<8-bytes>) 25
 Convert eight byte string value to double precision number.
-.IP EOF[(<file-number>)] 12
+.IP EOF[(<file-number>)] 25
 Returns -1 (true) if the end of a sequential file has been reached.
-.IP EXP(X) 12
+.IP EXP(X) 25
 Returns e(base of natural logarithm) to the power of X.
 X should be less then 10000.0.
-.IP FIX(X) 12
+.IP FIX(X) 25
 Returns the truncated integer part of X. FIX(X) is
 equivalent to SGN(X)*INT(ABS(X)).
 The major difference between FIX and INT is that FIX does not
 return the next lower number for negative X.
-.IP HEX$(X) 12
+.IP HEX$(X) 25
 Returns the string which represents the hexadecimal value of
 the decimal argument. X is rounded to an integer using CINT
 before HEX$ is evaluated.
-.IP INT(X) 12
+.IP INT(X) 25
 Returns the largest integer <= X.
-.IP INPUT$(X[,[#]Y]) 12
+.IP INP$(X[,[#]Y]) 25
 Returns the string of X characters read from the terminal or
 the designated file.
-.IP LEX(X$) 12
+.IP LEN(X$) 25
 Returns the number of characters in the string X$.
 Non printable and blancs are counted too.
-.IP LOC(<file\ number>) 12
+.IP LOC(<file\ number>) 25
 For sequential files LOC returns 
 position of the read/write head, counted in number of bytes.
 For random files the function returns the record number just
 read or written from a GET or PUT statement.
 If nothing was read or written 0 is returned.
-.IP LOG(X) 12
+.IP LOG(X) 25
 Returns the natural logarithm of X. X must be greater than zero.
-.IP MID$(X,I,[J]) 12
-To be implemented.
-.IP MKI$(X) 12
+.IP MID$(X,I,[J]) 25
+Returns first J characters from string X starting at position I in X.
+If J is omitted all characters starting of from position I in X are returned.
+.IP MKI$(X) 25
 Converts an integer expression to a two-byte string.
-.IP MKS$(X) 12
+.IP MKS$(X) 25
 Converts a single precision expression to a four-byte string.
-.IP MKD$(X) 12
+.IP MKD$(X) 25
 Converts a double precision expression to a eight-byte string.
-.IP OCT$(X) 12
+.IP OCT$(X) 25
 Returns the string which represents the octal value of the decimal
 argument. X is rounded to an integer using CINT before OCTS is evaluated.
-.IP PEEK(I) 12
+.IP PEEK(I) 25
 Returns the byte read from the indicated memory. (Of limited use
 in the context of ACK)
-.IP POS(I) 12
+.IP POS(I) 25
 Returns the current cursor position. To be implemented.
 .IP RIGHT$(X$,I)
 Returns the right most I characters of string X$.
 If I=0 then the empty string is returned.
-.IP RND(X) 12
+.IP RND(X) 25
 Returns a random number between 0 and 1. X is a dummy argument.
-.IP SGN(X) 12
+.IP SGN(X) 25
 If X>0 , SGN(X) returns 1.
 .br
 if X=0, SGN(X) returns 0.
 .br
 if X<0, SGN(X) returns -1.
-.IP SIN(X) 12
+.IP SIN(X) 25
 Returns the sine of X in radians.
-.IP SPACE$(X) 12
+.IP SPACE$(X) 25
 Returns  a string of spaces length X. The expression
 X is rounded to an integer using CINT.
 .IP STR$(X)
 Returns the string representation value of X.
-.IP STRING$(I,J) 12
+.IP STRING$(I,J) 25
 Returns thes string of length Iwhose characters all
 have ASCII code J. (or first character when J is a string)
-.IP TAB(I) 12
+.IP TAB(I) 25
 Spaces to position I on the terminal. If the current
 print position is already beyond space I,TAB
 goes to that position on the next line.
 Space 1 is leftmost position, and the rightmost position
 is width minus 1. To be used within PRINT statements only.
-.IP TAN(X) 12
+.IP TAN(X) 25
 Returns the tangent of X in radians. If TAN overflows
 the "Overflow" message is displayed.
-.IP VAL(X$) 12
+.IP VAL(X$) 25
 Returns the numerical value of string X$.
 The VAL function strips leading blanks and tabs from the
 argument string.
+.bp
 .SH
 APPENDIX A DIFFERENCES WITH MICROSOFT BASIC
 .LP
@@ -847,3 +906,44 @@ LSET
 RSET
 PUT
 .DE
+.bp
+.SH
+APPENDIX B RESERVED WORDS IN BASIC-EM
+.LP
+The following list of words/symbols/names/identifiers are reserved, which
+means that they can not be used for variable-names.
+.DS
+ABS		AND		ASC		AS
+ATN		AUTO		BASE		CALL
+CDBL		CHAIN		CHR		CINT
+CLEAR		CLOAD	CLOSE		COMMON
+CONT		COS		CSNG		CSAVE
+CVI		CVS		CVD		DATA
+DEFINT	DEFSNG	DEFDBL	DEFSTR
+DEF		DELETE	DIM		EDIT
+ELSE		END		EOF		ERASE
+ERROR		ERR		ERL		ELSE
+EQV		EXP		FIELD		FIX
+FOR		FRE		GET		GOSUB
+GOTO		HEX		IF		IMP
+INKEY		INPUT		INP		INSTR
+INT		KILL		LEFT		LEN		
+LET		LINE		LIST		LLIST
+LOAD		LOC		LOG		LPOS
+LPRINT	LSET		MERGE	MID
+MKI		MKS		MKD		MOD
+NAME		NEW		NEXT		NOT		
+NULL		ON		OCT		OPEN
+OPTION	OR		OUT		PEEK
+POKE		PRINT		POS		PUT
+RANDOMIZE	READ		REM		RENUM
+REN		RESTORE	RESUME	RETURN
+RIGHT		RND		RUN		SAVE
+STEP		SGN		SIN		SPACE
+SPC		SQR		STOP		STRING
+STR		SWAP		TAB		TAN
+THEN		TO		TRON		TROFF
+USING		USR		VAL		VARPTR
+WAIT		WHILE		WEND		WIDTH
+WRITE		XOR
+.DE

doc/ceg/.distr

@@ -0,0 +1,3 @@
+proto.make
+ceg.ref
+ceg.tr

doc/ceg/ceg.ref

@@ -0,0 +1,42 @@
+%T A Practical Toolkit For Making Compilers
+%A A.S. Tanenbaum
+%A H. v. Staveren
+%A E.G. Keizer
+%A J.W. Stevenson
+%J Communications of the ACM
+%V 26
+%N 9
+%D September 1983
+
+%T Description of a Machine Architecture for Use with Block Structured Languages
+%A A.S. Tanenbuum
+%A H. v. Staveren
+%A E.G. Keizer
+%A J.W. Stevenson
+%R IR-81
+%I Dept. Mathematics and Computer Science, Vrije Universiteit
+%C Amsterdam
+%D August 1983
+
+%T EM_CODE(3ACK)
+%A ACK Documentation
+%I Dept. Mathematics and Computer Science, Vrije Universiteit
+%C Amsterdam
+
+%T ACK.OUT(5ACK)
+%A ACK Documentation
+%I Dept. Mathematics and Computer Science, Vrije Universiteit
+%C Amsterdam
+%K aout
+
+%T PRINT(3ACK)
+%A ACK Documentation
+%I Dept. Mathematics and Computer Science, Vrije Universiteit
+%C Amsterdam
+
+%T The C Programming Language
+%A B.W. Kernighan
+%A D.M. Ritchie
+%I Prentice-Hall Inc.
+%C Englewood Cliffs, New Jersey
+%D 1978

doc/ceg/proto.make

@@ -0,0 +1,12 @@
+# $Id$
+
+#PARAMS         do not remove this line!
+
+SRC_DIR = $(SRC_HOME)/doc/ceg
+
+PIC=pic
+TBL=tbl
+REFER=refer
+
+$(TARGET_HOME)/doc/ceg.doc:	$(SRC_DIR)/ceg.tr $(SRC_DIR)/ceg.ref
+	$(PIC) $(SRC_DIR)/ceg.tr | $(REFER) -e -p $(SRC_DIR)/ceg.ref | $(TBL) > $@

doc/cg.doc

@@ -1,4 +1,4 @@
-.\" $Header$
+.\" $Id$
 .RP
 .ND Nov 1984
 .TL
@@ -374,12 +374,12 @@ It is undefined when the instruction has no operand.
 .br
 Although an exhaustive list could be given describing all the types
 the following rule of thumb will suffice.
-If you cannot imagine the operand of the instruction ever to be
+If it is unimaginable for the operand of the instruction ever to be
 something different from a plain integer, the type is integer,
 otherwise it is string.
 .br
 .I Cg
-makes all necessary conversions for you,
+makes all necessary conversions,
 like adding EM_BSIZE to positive arguments of instructions
 dealing with locals,
 prepending underlines to global names,
@@ -776,8 +776,8 @@ Items are pushed in the order of appearance.
 This means that the last item will be on the top of the
 stack after the push.
 So if the stack pattern contained two token expressions
-and you want to push them back unchanged,
-you have to specify as stack replacement
+and they must be pushed back unchanged,
+they have to be specified as stack replacement
 .DS
 %[2] %[1]
 .DE
@@ -878,7 +878,7 @@ and shows how to place erase() and setcc() calls.
 	"sxt %[a.even]" | { PAIRSIGNED, %[a.1], %[a.2] }| | 
 .DE
 This coercion shows how to use the move and test calls.
-At first you might think that the testcall is unnecessary,
+At first one might think that the testcall is unnecessary,
 since the move will have set the condition codes,
 but the move may never have been executed
 if the register already contained the value,
@@ -1155,8 +1155,8 @@ from the string of size w_size and generate code to assemble global
 data for that integer.
 Only the sizes for which arithmetic is implemented need be
 handled,
-so if you didn't implement 200-byte integer division
-you don't have to implement 200-byte integer global data.
+so if 200-byte integer division is not implemented,
+200-byte integer global data do not have to be implemented.
 Here one must take care of word order in long integers.
 .IP con_float()
 This function must generate code to assemble a floating
@@ -1170,7 +1170,8 @@ and room made for local variables for a total of f_nlocals bytes.
 This function is called when a
 .B mes
 pseudo is seen that is not handled by the machine independent part.
-Example below shows all you probably have to know about that.
+The example below probably shows all the table writer ever has to know
+about that.
 .IP segname[]
 This is not a function,
 but an array of four strings.

doc/crefman.doc

@@ -1,3 +1,5 @@
+\." $Id$
+.\" eqn crefman.doc | troff -ms
 .EQ
 delim $$
 .EN
@@ -32,42 +34,42 @@ programs.
 .SH
 2.3 Keywords
 .SH
-\f5asm\fP
+\f(CWasm\fP
 .PP
-The keyword \f5asm\fP
+The keyword \f(CWasm\fP
 is recognized.
 However, the statement
 .DS
-.ft 5
+.ft CW
 asm(string);
 .ft R
 .DE
 is skipped, while a warning is given.
 .SH
-\f5enum\fP
+\f(CWenum\fP
 .PP
-The \f5enum\fP keyword is recognized and interpreted.
+The \f(CWenum\fP keyword is recognized and interpreted.
 .SH
-\f5entry\fP, \f5fortran\fP
+\f(CWentry\fP, \f(CWfortran\fP
 .PP
-The words \f5entry\fP and \f5fortran\fP
+The words \f(CWentry\fP and \f(CWfortran\fP
 are reserved under the restricted option.
 The words are not interpreted by the compiler.
 .SH
 2.4.1 Integer Constants
 .PP
-An octal or hex constant which is less than or equal to the largest unsigned
-(target) machine integer is taken to be \f5unsigned\fP.
-An octal or hex constant which exceeds the largest unsigned (target) machine
-integer is taken to be \f5long\fP.
+The type of an integer constant is the first of the corresponding list
+in which its value can be represented. Decimal: \f(CWint, long, unsigned long\fP;
+octal or hexadecimal: \f(CWint, unsigned, long, unsigned long\fP; suffixed by
+the letter L or l: \f(CWlong, unsigned long\fP.
 .SH
 2.4.3 Character Constants
 .PP
-A character constant is a sequence of 1 up to \f5sizeof(int)\fP characters
+A character constant is a sequence of 1 up to \f(CWsizeof(int)\fP characters
 enclosed in single quotes.
 The value of a character constant '$c sub 1 c sub 2 ... c sub n$'
 is $d sub n + M \(mu d sub {n - 1} + ... + M sup {n - 1} \(mu d sub 2 + M sup n \(mu d sub 1$,
-where M is 1 + maximum unsigned number representable in an \f5unsigned char\fP,
+where M is 1 + maximum unsigned number representable in an \f(CWunsigned char\fP,
 and $d sub i$ is the signed value (ASCII)
 of character $c sub i$.
 .SH
@@ -80,46 +82,46 @@ The compiler does not support compile-time floating point arithmetic.
 The compiler is capable of producing EM code for machines with the following
 properties
 .IP \(bu
-a \f5char\fP is 8 bits
+a \f(CWchar\fP is 8 bits
 .IP \(bu
-the size of \f5int\fP is equal to the word size
+the size of \f(CWint\fP is equal to the word size
 .IP \(bu
-the size of \f5short\fP may not exceed the size of \f5int\fP
+the size of \f(CWshort\fP may not exceed the size of \f(CWint\fP
 .IP \(bu
-the size of \f5int\fP may not exceed the size of \f5long\fP
+the size of \f(CWint\fP may not exceed the size of \f(CWlong\fP
 .IP \(bu
-the size of pointers is equal to the size of either \f5short\fP, \f5int\fP
-or \f5long\fP
+the size of pointers is equal to the size of either \f(CWshort\fP, \f(CWint\fP
+or \f(CWlong\fP
 .LP
 .SH
 4 What's in a name?
 .SH
-\f5char\fP
+\f(CWchar\fP
 .PP
-Objects of type \f5char\fP are taken to be signed.
-The combination \f5unsigned char\fP is legal.
+Objects of type \f(CWchar\fP are taken to be signed.
+The combination \f(CWunsigned char\fP is legal.
 .SH
-\f5unsigned\fP
+\f(CWunsigned\fP
 .PP
-The type combinations \f5unsigned char\fP, \f5unsigned short\fP and
-\f5unsigned long\fP are supported.
+The type combinations \f(CWunsigned char\fP, \f(CWunsigned short\fP and
+\f(CWunsigned long\fP are supported.
 .SH
-\f5enum\fP
+\f(CWenum\fP
 .PP
-The data type \f5enum\fP is implemented as described 
+The data type \f(CWenum\fP is implemented as described 
 in \fIRecent Changes to C\fP (see appendix A).
 .I Cem
-treats enumeration variables as if they were \f5int\fP.
+treats enumeration variables as if they were \f(CWint\fP.
 .SH
-\f5void\fP
+\f(CWvoid\fP
 .PP
-Type \f5void\fP is implemented.
+Type \f(CWvoid\fP is implemented.
 The type specifies an empty set of values, which takes no storage space.
 .SH
 \fRFundamental types\fP
 .PP
 The names of the fundamental types can be redefined by the user, using
-\f5typedef\fP.
+\f(CWtypedef\fP.
 .SH
 7 Expressions
 .PP
@@ -131,7 +133,7 @@ Parameter lists are evaluated from right to left.
 .SH
 7.2 Unary operators
 .PP
-The type of a \f5sizeof\fP expression is \f5unsigned int\fP.
+The type of a \f(CWsizeof\fP expression is \f(CWunsigned int\fP.
 .SH
 7.13 Conditional operator
 .PP
@@ -147,8 +149,8 @@ The types of operands taking part must be the same.
 .SH
 8.2 Type specifiers
 .PP
-The combinations \f5unsigned char\fP, \f5unsigned short\fP
-and \f5unsigned long\fP are implemented.
+The combinations \f(CWunsigned char\fP, \f(CWunsigned short\fP
+and \f(CWunsigned long\fP are implemented.
 .SH
 8.5 Structure and union declarations
 .PP
@@ -157,7 +159,7 @@ are supported, as long as the type fits in a word on the target machine.
 .PP
 Fields are left adjusted by default; the first field is put into the left
 part of a word, the next one on the right side of the first one, etc.
-The \f5-Vr\fP option in the call of the compiler
+The \f(CW-Vr\fP option in the call of the compiler
 causes fields to be right adjusted within a machine word.
 .PP
 The tags of structs and unions occupy a different name space from that of 
@@ -167,12 +169,12 @@ variables and that of member names.
 .PP
 The type of \fIexpression\fP in
 .DS
-.ft 5
-\f5switch (\fP\fIexpression\fP\f5)\fP \fIstatement\fP
+.ft CW
+\f(CWswitch (\fP\fIexpression\fP\f(CW)\fP \fIstatement\fP
 .ft
 .DE
 must be integral.
-A warning is given under the restricted option if the type is \f5long\fP.
+A warning is given under the restricted option if the type is \f(CWlong\fP.
 .SH
 10 External definitions
 .PP
@@ -190,21 +192,21 @@ in \(sc11.1 is walked correctly.
 .SH
 12 Compiler control lines
 .PP
-Lines which do not occur within comment, and with \f5#\fP as first
+Lines which do not occur within comment, and with \f(CW#\fP as first
 character, are interpreted as compiler control line.
 There may be an arbitrary number of spaces, tabs and comments (collectively
-referred as \fIwhite space\fP) following the \f5#\fP.
+referred as \fIwhite space\fP) following the \f(CW#\fP.
 Comments may contain newline characters.
-Control lines with only white space between the \f5#\fP and the line separator
+Control lines with only white space between the \f(CW#\fP and the line separator
 are skipped.
 .PP
-The #\f5include\fP, #\f5ifdef\fP, #\f5ifndef\fP, #\f5undef\fP, #\f5else\fP and
-#\f5endif\fP control lines and line directives consist of a fixed number of
+The #\f(CWinclude\fP, #\f(CWifdef\fP, #\f(CWifndef\fP, #\f(CWundef\fP, #\f(CWelse\fP and
+#\f(CWendif\fP control lines and line directives consist of a fixed number of
 arguments.
 The list of arguments may be followed an arbitrary sequence of characters,
 in which comment is interpreted as such.
-(I.e., the text between \f5/*\fP and \f5*/\fP is skipped, regardless of
-newlines; note that commented-out lines beginning with \f5#\fP are not
+(I.e., the text between \f(CW/*\fP and \f(CW*/\fP is skipped, regardless of
+newlines; note that commented-out lines beginning with \f(CW#\fP are not
 considered to be control lines.)
 .SH
 12.1 Token replacement
@@ -216,10 +218,10 @@ Comments and newline characters, preceeded by a backslash, in the replacement
 text are replaced by a space character.
 .PP
 The actual parameters of a macro are considered tokens and are
-balanced with regard to \f5()\fP, \f5{}\fP and \f5[]\fP.
+balanced with regard to \f(CW()\fP, \f(CW{}\fP and \f(CW[]\fP.
 This prevents the use of macros like
 .DS
-.ft 5
+.ft CW
 CTL([)
 .ft
 .DE
@@ -228,22 +230,22 @@ Formal parameters of a macro must have unique names within the formal-parameter
 list of that macro.
 .PP
 A message is given at the definition of a macro if the macro has 
-already been #\f5defined\fP, while the number of formal parameters differ or
+already been #\f(CWdefined\fP, while the number of formal parameters differ or
 the replacement texts are not equal (apart from leading and trailing
 white space).
 .PP
 Recursive use of macros is detected by the compiler.
 .PP
-Standard #\f5defined\fP macros are
+Standard #\f(CWdefined\fP macros are
 .DS
-\f5__FILE__\fP  name of current input file as string constant
-\f5__DATE__\fP  curent date as string constant; e.g. \f5"Tue Wed  2 14:45:23 1986"\fP
-\f5__LINE__\fP  current line number as an integer
+\f(CW__FILE__\fP  name of current input file as string constant
+\f(CW__DATE__\fP  curent date as string constant; e.g. \f(CW"Tue Wed  2 14:45:23 1986"\fP
+\f(CW__LINE__\fP  current line number as an integer
 .DE
 .PP
 No message is given if \fIidentifier\fP is not known in
 .DS
-.ft 5
+.ft CW
 #undef \fIidentifier\fP
 .ft
 .DE
@@ -254,18 +256,18 @@ A newline character is appended to each file which is included.
 .SH
 12.3 Conditional compilation
 .PP
-The #\f5if\fP, #\f5ifdef\fP and #\f5ifndef\fP control lines may be followed
+The #\f(CWif\fP, #\f(CWifdef\fP and #\f(CWifndef\fP control lines may be followed
 by an arbitrary number of
 .DS
-.ft 5
+.ft CW
 #elif \fIconstant-expression\fP
 .ft
 .DE
-control lines, before the corresponding #\f5else\fP or #\f5endif\fP
+control lines, before the corresponding #\f(CWelse\fP or #\f(CWendif\fP
 is encountered.
 The construct
 .DS
-.ft 5
+.ft CW
 #elif \fIconstant-expression\fP
 some text
 #endif /* corresponding to #elif */
@@ -273,7 +275,7 @@ some text
 .DE
 is equivalent to
 .DS
-.ft 5
+.ft CW
 #else
 #if \fIconstant-expression\fP
 some text
@@ -282,15 +284,15 @@ some text
 .ft
 .DE
 .PP
-The \fIconstant-expression\fP in #\f5if\fP and #\f5elif\fP control lines
+The \fIconstant-expression\fP in #\f(CWif\fP and #\f(CWelif\fP control lines
 may contain the construction
 .DS
-.ft 5
+.ft CW
 defined(\fIidentifier\fP)
 .ft
 .DE
-which is replaced by \f51\fP, if \fIidentifier\fP has been #\f5defined\fP,
-and by \f50\fP, if not.
+which is replaced by \f(CW1\fP, if \fIidentifier\fP has been #\f(CWdefined\fP,
+and by \f(CW0\fP, if not.
 .PP
 Comments in skipped lines are interpreted as such.
 .SH
@@ -298,7 +300,7 @@ Comments in skipped lines are interpreted as such.
 .PP
 Line directives may occur in the following forms:
 .DS
-.ft 5
+.ft CW
 #line \fIconstant\fP
 #line \fIconstant\fP "\fIfilename\fP"
 #\fIconstant\fP
@@ -326,7 +328,7 @@ global variable initialization value
 .IP \(bu
 enum-value specifier
 .IP \(bu
-truth value in \f5#if\fP control line
+truth value in \f(CW#if\fP control line
 .LP
 .PP
 Constant integral expressions are compile-time evaluated while an effort
@@ -354,12 +356,12 @@ Prepend \fIpath\fR to the list of include directories.
 To put the directories "include", "sys/h" and "util/h" into the
 include directory list in that order, the user has to specify
 .DS
-.ft 5
+.ft CW
 -Iinclude -Isys/h -Iutil/h
 .ft R
 .DE
 An empty \fIpath\fP causes the standard include
-directory (usually \f5/usr/include\fP) to be forgotten.
+directory (usually \f(CW/usr/include\fP) to be forgotten.
 .IP \fB\-M\fP\fIn\fP
 .br
 Set maximum significant identifier length to \fIn\fP.
@@ -383,7 +385,7 @@ Create temporary files, if necessary, in directory \fIpath\fP.
 Get rid of the compiler-predefined macro \fIname\fP, i.e.,
 consider
 .DS
-.ft 5
+.ft CW
 #undef \fIname\fP
 .ft R
 .DE
@@ -416,7 +418,7 @@ Some particular flags may be recognized, others may have surprising effects.
 Generate a dependency graph, reflecting the calling structure of functions.
 Lines of the form
 .DS
-.ft 5
+.ft CW
 DFA: \fIcalling-function\fP: \fIcalled-function\fP
 .ft
 .DE
@@ -474,11 +476,11 @@ The syntax is
 .RS
 .I enum-specifier :
 .RS
-\&\f5enum\fP { \fIenum-list\fP }
+\&\f(CWenum\fP { \fIenum-list\fP }
 .br
-\&\f5enum\fP \fIidentifier\fP { \fIenum-list\fP }
+\&\f(CWenum\fP \fIidentifier\fP { \fIenum-list\fP }
 .br
-\&\f5enum\fP \fIidentifier\fP
+\&\f(CWenum\fP \fIidentifier\fP
 .RE
 .sp
 \&\fIenum-list\fP :

doc/ego/.distr

@@ -1,4 +1,4 @@
-Makefile
+proto.make
 bo
 ca
 cf

doc/ego/Makefile

@@ -1,52 +0,0 @@
-REFS=-p refs.opt -p refs.stat -p refs.gen
-INTRO=intro/intro?
-OV=ov/ov?
-IC=ic/ic?
-CF=cf/cf?
-IL=il/il?
-SR=sr/sr?
-CS=cs/cs?
-SP=sp/sp?
-UD=ud/ud?
-LV=lv/lv?
-CJ=cj/cj?
-BO=bo/bo?
-RA=ra/ra?
-CA=ca/ca?
-EGO=$(INTRO) $(OV) $(IC) $(CF) $(IL) $(SR) $(CS) $(SP) $(CJ) $(BO) \
-    $(UD) $(LV) $(RA) $(CA)
-REFER=refer
-
-../ego.doc:	$(EGO)
-	 $(REFER) -sA+T -l4,2 $(REFS) intro/head $(EGO) intro/tail > ../ego.doc
-
-ego.f:	$(EGO)
-	 $(REFER)  -sA+T -l4,2 $(REFS) intro/head $(EGO) intro/tail | nroff -ms > ego.f
-intro.f:	$(INTRO)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ov/head $(INTRO) intro/tail | nroff -ms > intro.f
-ov.f:	$(OV)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ov/head $(OV) intro/tail | nroff -ms > ov.f
-ic.f:	$(IC)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ic/head $(IC) intro/tail | nroff -ms > ic.f
-cf.f:	$(CF)
-	 $(REFER)  -sA+T -l4,2 $(REFS) cf/head $(CF) intro/tail | nroff -ms > cf.f
-il.f:	$(IL)
-	 $(REFER)  -sA+T -l4,2 $(REFS) il/head $(IL) intro/tail | nroff -ms > il.f
-sr.f:	$(SR)
-	 $(REFER)  -sA+T -l4,2 $(REFS) sr/head $(SR) intro/tail | nroff -ms > sr.f
-cs.f:	$(CS)
-	 $(REFER)	-sA+T -l4,2 $(REFS) cs/head $(CS) intro/tail | nroff -ms > cs.f
-sp.f:	$(SP)
-	 $(REFER)  -sA+T -l4,2 $(REFS) sp/head $(SP) intro/tail | nroff -ms > sp.f
-cj.f:	$(CJ)
-	 $(REFER)  -sA+T -l4,2 $(REFS) cj/head $(CJ) intro/tail | nroff -ms > cj.f
-bo.f:	$(BO)
-	 $(REFER)  -sA+T -l4,2 $(REFS) bo/head $(BO) intro/tail | nroff -ms > bo.f
-ud.f:	$(UD)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ud/head $(UD) intro/tail | nroff -ms > ud.f
-lv.f:	$(LV)
-	 $(REFER)  -sA+T -l4,2 $(REFS) lv/head $(LV) intro/tail | nroff -ms > lv.f
-ra.f:	$(RA)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ra/head $(RA) intro/tail | nroff -ms > ra.f
-ca.f:	$(CA)
-	 $(REFER)  -sA+T -l4,2 $(REFS) ca/head $(CA) intro/tail | nroff -ms > ca.f

doc/ego/bo/bo1

@@ -27,20 +27,23 @@ While-loop optimization
 The straightforward way to translate a while loop is to
 put the test for loop termination at the beginning of the loop.
 .DS
-while cond loop                  LAB1: Test cond
-   body of the loop     --->           Branch On False To LAB2
-end loop                               code for body of loop
-				       Branch To LAB1
-				 LAB2:
+while cond loop                       \kyLAB1: \kxTest cond
+   body of the loop     --->\h'|\nxu'Branch On False To LAB2
+end loop\h'|\nxu'code for body of loop
+\h'|\nxu'Branch To LAB1
+\h'|\nyu'LAB2:
 
 Fig. 10.1 Example of Branch Optimization
 .DE
 If the condition fails at the Nth iteration, the following code
 gets executed (dynamically):
 .DS
-N   *  conditional branch (which fails N-1 times)
-N-1 *  unconditional branch
-N-1 *  body of the loop
+.TS
+l l l.
+N	*	conditional branch (which fails N-1 times)
+N-1	*	unconditional branch
+N-1	*	body of the loop
+.TE
 .DE
 An alternative translation is:
 .DS
@@ -53,9 +56,12 @@ LAB2:
 .DE
 This translation results in the following profile:
 .DS
-N   *  conditional branch (which succeeds N-1 times)
-1   *  unconditional branch
-N-1 *  body of the loop
+.TS
+l l l.
+N	*	conditional branch (which succeeds N-1 times)
+1	*	unconditional branch
+N-1	*	body of the loop
+.TE
 .DE
 So the second translation will be significantly faster if N >> 2.
 If N=2, execution time will be slightly increased.
@@ -79,12 +85,15 @@ the basic block that comes textually next to S must stay
 in that position.
 So the transformation in Fig. 10.2 is illegal.
 .DS
-LAB1: S1              LAB1: S1
-      BRA LAB2        S2
-      ...       -->   BEQ LAB3
-LAB2: S2              ...
-      BEQ LAB3        S3
-      S3
+.TS
+l l l l l.
+LAB1:	S1		LAB1:	S1
+	BRA LAB2			S2
+	...	-->		BEQ LAB3
+LAB2:	S2			...
+	BEQ LAB3			S3
+	S3
+.TE
 
 Fig. 10.2 An illegal transformation of Branch Optimization
 .DE
@@ -118,34 +127,36 @@ the last instruction of S is a conditional branch
 If such a block B is found, the control flow graph is changed
 as depicted in Fig. 10.3.
 .DS
-       |				    |
-       |				    v
-       v				    |
-       |-----<------|			    ----->-----|
-   ____|____	    |				       |
-   |	   |	    |		    |-------|	       |
-   |  S1   |	    |		    |	    v	       |
-   |  Bcc  |	    |		    |	  ....	       |
-|--|	   |	    |		    |		       |
-|  ---------	    |		    |	----|----      |
-|		    |		    |	|	|      |
-|     ....	    ^		    |	|  S2	|      |
-|		    |		    |	|	|      |
-|   ---------	    |		    |	|	|      |
-v   |	    |	    |		    ^	---------      |
-|   |  S2   |	    |		    |	    |	       |
-|   | BRA   |	    |		    |	    |-----<-----
-|   |	    |	    |		    |	    v
-|   ---------	    |		    |	____|____
-|	|	    |		    |	|	|
-|	------>------		    |	|  S1	|
-|				    |	|  Bnn  |
-|-------|			    |	|	|
-	|			    |	----|----
-	v			    |	    |
-				    |----<--|
-					    |
-					    v
+.ft 5
+       |                                    |
+       |                                    v
+       v                                    |
+       |-----<------|                       ----->-----|
+   ____|____        |                                  |
+   |       |        |               |-------|          |
+   |  S1   |        |               |       v          |
+   |  Bcc  |        |               |     ....         |
+|--|       |        |               |                  |
+|  ---------        |               |   ----|----      |
+|                   |               |   |       |      |
+|     ....          ^               |   |  S2   |      |
+|                   |               |   |       |      |
+|   ---------       |               |   |       |      |
+v   |       |       |               ^   ---------      |
+|   |  S2   |       |               |       |          |
+|   | BRA   |       |               |       |-----<-----
+|   |       |       |               |       v
+|   ---------       |               |   ____|____
+|       |           |               |   |       |
+|       ------>------               |   |  S1   |
+|                                   |   |  Bnn  |
+|-------|                           |   |       |
+        |                           |   ----|----
+        v                           |       |
+                                    |----<--|
+                                            |
+                                            v
+.ft R
 
 Fig. 10.3 Transformation of the CFG by Branch Optimization
 .DE

doc/ego/ca/ca1

@@ -63,13 +63,3 @@ present in the input program).
 On the other hand, an identifier may be only internally visible.
 If such an identifier is referenced before being defined,
 an INA or INP pseudo must be emitted prior to its first reference.
-.UH
-Acknowledgements
-.PP
-The author would like to thank Andy Tanenbaum for his guidance,
-Duk Bekema for implementing the Common Subexpression Elimination phase
-and writing the initial documentation of that phase,
-Dick Grune for reading the manuscript of this report
-and Ceriel Jacobs, Ed Keizer, Martin Kersten, Hans van Staveren
-and the members of the S.T.W. user's group for their
-interest and assistance.

doc/ego/cf/cf4

@@ -15,8 +15,8 @@ that can reach B without going through C.
 .PP
 As an example of how the algorithm works,
 consider the piece of program of Fig. 4.1.
-First just look at the program and think for
-yourself what part of the code constitutes the loop.
+First just look at the program and try to
+see what part of the code constitutes the loop.
 .DS
 loop
    if cond then                       1

doc/ego/cf/cf5

@@ -7,9 +7,12 @@ The optimization below is only possible if
 we know for sure that the call to P cannot
 change A.
 .DS
-A := 10;                        A:= 10;
-P;  -- procedure call    -->    P;
-B := A + 2;                     B := 12;
+.TS
+l l.
+A := 10;	A:= 10;
+P;  -- procedure call    -->	P;
+B := A + 2;	B := 12;
+.TE
 .DE
 Although it is not possible to predict exactly
 all the effects a procedure call has, we may

doc/ego/cj/cj1

@@ -27,16 +27,18 @@ else
     S3
 
 (pseudo) EM:
-
-TEST COND		TEST COND
-BNE *1			BNE *1
-S1			S1
-S3	   --->		BRA *2
-BRA *2			1:
-1:			S2
-S2			2:
-S3			S3
+.TS
+l l l.
+ TEST COND		 TEST COND
+ BNE *1		 BNE *1
+ S1		 S1
+ S3	--->	 BRA *2
+ BRA *2		1:
+1:		 S2
+ S2		2:
+ S3		 S3
 2:
+.TE
 
 Fig. 9.1 An example of Cross Jumping
 .DE
@@ -54,20 +56,23 @@ as demonstrated by the Fig. 8.2.
 .DS
 	Pascal:
 
-	if cond then
-	   x := f(4)
-	else
-	   x := g(5)
+if cond then
+   x := f(4)
+else
+   x := g(5)
 
 
-	EM:
+EM:
 
-	...                     ...
-	LOC 4			LOC 5
-	CAL F			CAL G
-	ASP 2			ASP 2
-	LFR 2			LFR 2
-	STL X			STL X
+.TS
+l l.
+...	...
+LOC 4	LOC 5
+CAL F	CAL G
+ASP 2	ASP 2
+LFR 2	LFR 2
+STL X	STL X
+.TE
 
 Fig. 9.2 Effectiveness of Cross Jumping
 .DE
@@ -92,37 +97,40 @@ blocks must be split into two.
 The control flow graphs before and after the optimization are shown
 in Fig. 9.3 and Fig. 9.4.
 .DS
+.ft 5
 
-	--------				--------
-	|      |				|      |
-	| S1   |			        | S2   |
-	| S3   |   				| S3   |
-	|      |				|      |
-	--------				--------
-	   |					   |
-	   |------------------|--------------------|
-			      |
-			      v
+        --------                                --------
+        |      |                                |      |
+        | S1   |                                | S2   |
+        | S3   |                                | S3   |
+        |      |                                |      |
+        --------                                --------
+           |                                       |
+           |------------------|--------------------|
+                              |
+                              v
+.ft R
 
 Fig. 9.3 CFG before optimization
 .DE
 .DS
-
-	--------				--------
-	|      |				|      |
-	| S1   |			        | S2   |
-	|      |				|      |
-	--------				--------
-	   |					   |
-	   |--------------------<------------------|
-	   v
-	--------
-	|      |
-	| S3   |
-	|      |
-	--------
-	   |
-	   v
+.ft 5
+        --------                                --------
+        |      |                                |      |
+        | S1   |                                | S2   |
+        |      |                                |      |
+        --------                                --------
+           |                                       |
+           |--------------------<------------------|
+           v
+        --------
+        |      |
+        | S3   |
+        |      |
+        --------
+           |
+           v
+.ft R
 
 Fig. 9.4 CFG after optimization
 .DE

doc/ego/cs/cs1

@@ -18,12 +18,15 @@ but in general it will save space too.
 As an example of the application of Common Subexpression Elimination,
 consider the piece of program in Fig. 7.1(a).
 .DS
-x := a * b;          TMP := a * b;       x := a * b;
-CODE;                x := TMP;           CODE
-y := c + a * b;      CODE                y := x;
-                     y := c + TMP;
+.TS
+l l l.
+x := a * b;	TMP := a * b;	x := a * b;
+CODE;	x := TMP;	CODE
+y := c + a * b;	CODE	y := x;
+	y := c + TMP;
 
-   (a)                  (b)                 (c)
+   (a)	   (b)	   (c)
+.TE
 
 Fig. 7.1  Examples of Common Subexpression Elimination
 .DE

doc/ego/cs/cs2

@@ -70,10 +70,13 @@ a common subexpression,
 references to the element itself are replaced by
 indirect references through TMP (see Fig. 7.4).
 .DS
-x := A[i];			TMP := &A[i];
-  . . .			-->	x := *TMP;
-A[i] := y;			   . . .
-				*TMP := y;
+.TS
+l l l.
+x := A[i];		TMP := &A[i];
+  . . .	-->	x := *TMP;
+A[i] := y;		   . . .
+			*TMP := y;
+.TE
 
 Fig. 7.4 Elimination of an array address computation
 .DE

doc/ego/cs/cs3

@@ -27,10 +27,13 @@ The value number of the result of an expression depends only
 on the kind of operator and the value number(s) of the operand(s).
 The expressions need not be textually equal, as shown in Fig. 7.5.
 .DS
-a := c;		(1)
+.TS
+l l.
+a := c;	(1)
 use(a * b);	(2)
-d := b;		(3)
+d := b;	(3)
 use(c * d);	(4)
+.TE
 
 Fig. 7.5 Different expressions with the same value number
 .DE
@@ -43,9 +46,12 @@ and the operator (*) is the same.
 .PP
 As another example of the value number method, consider Fig. 7.6.
 .DS
+.TS
+l l.
 use(a * b);	(1)
 a := 123;	(2)
 use(a * b);	(3)
+.TE
 
 Fig. 7.6 Identical expressions with the different value numbers
 .DE
@@ -64,7 +70,7 @@ of its operands.
 A table of "available expressions" is used to do this mapping.
 .PP
 CS recognizes the following kinds of EM operands, called \fIentities\fR:
-.IP
+.DS
 - constant
 - local variable
 - external variable
@@ -81,6 +87,7 @@ CS recognizes the following kinds of EM operands, called \fIentities\fR:
 - local base
 - heap pointer
 - ignore mask
+.DE
 .LP
 Whenever a new entity is encountered in the working window,
 it is entered in the symbol table and given a brand new value number.

doc/ego/cs/cs4

@@ -26,26 +26,26 @@ There are groups for all sorts of operators:
 unary, binary, and ternary.
 The groups of operators are further partitioned according to the size
 of their operand(s) and result.
-\" .PP
-\" The distinction between operators and expensive loads is not always clear.
-\" The ADP instruction for example,
-\" might seem a unary operator because it pops one item
-\" (a pointer) from the stack.
-\" However, two ADP-instructions which pop an item with the same value number
-\" need not have the same result,
-\" because the attributes (an offset, to be added to the pointer)
-\" can be different.
-\" Is it then a binary operator?
-\" That would give rise to the strange, and undesirable,
-\" situation that some binary operators pop two operands
-\" and others pop one.
-\" The conclusion is inevitable:
-\" we have been fooled by the name (ADd Pointer).
-\" The ADP-instruction is an expensive load.
-\" In this context LAF, meaning Load Address of oFfsetted,
-\" would have been a better name,
-\" corresponding to LOF, like LAL,
-\" Load Address of Local, corresponds to LOL.
+.\" .PP
+.\" The distinction between operators and expensive loads is not always clear.
+.\" The ADP instruction for example,
+.\" might seem a unary operator because it pops one item
+.\" (a pointer) from the stack.
+.\" However, two ADP-instructions which pop an item with the same value number
+.\" need not have the same result,
+.\" because the attributes (an offset, to be added to the pointer)
+.\" can be different.
+.\" Is it then a binary operator?
+.\" That would give rise to the strange, and undesirable,
+.\" situation that some binary operators pop two operands
+.\" and others pop one.
+.\" The conclusion is inevitable:
+.\" we have been fooled by the name (ADd Pointer).
+.\" The ADP-instruction is an expensive load.
+.\" In this context LAF, meaning Load Address of oFfsetted,
+.\" would have been a better name,
+.\" corresponding to LOF, like LAL,
+.\" Load Address of Local, corresponds to LOL.
 .PP
 There are groups for all sorts of stores:
 direct, indirect, array element.
@@ -91,10 +91,13 @@ because EM expressions are postfix.
 When we find an instruction to load an operand,
 we load on the fake-stack a struct with the following information:
 .DS
-(1) the value number of the operand
-(2) the size of the operand
-(3) a pointer to the first line of EM-code
-    that constitutes the operand
+.TS
+l l.
+(1)	the value number of the operand
+(2)	the size of the operand
+(3)	a pointer to the first line of EM-code
+	that constitutes the operand
+.TE
 .DE
 In most cases, (3) will point to the line
 that loaded the operand (e.g. LOL, LOC),
@@ -121,13 +124,16 @@ a recurrence of this expression.
 Not only will the operand(s) be popped from the fake-stack,
 but the following will be pushed:
 .DS
-(1) the value number of the result
-(2) the size of the result
-(3) a pointer to the first line of the expression
+.TS
+l l.
+(1)	the value number of the result
+(2)	the size of the result
+(3)	a pointer to the first line of the expression
+.TE
 .DE
 In this way an item on the fake-stack always contains
 the necessary information.
-As you see, EM expressions are parsed bottum up.
+EM expressions are parsed bottum up.
 .NH 3
 Updating entities
 .PP

doc/ego/ic/ic2

@@ -90,18 +90,22 @@ and let the null item be 0.
 Then the tree of fig. 3.1(a)
 can be represented as in fig. 3.1(b).
 .DS
+.ft 5
                         4
-
+                      /   \e
                     9      12
-
+                  /  \e    /  \e
                 12    3   4   6
-
+                     / \e  \e  /
                      8  1  5 1
+.ft R
 
 Fig. 3.1(a) A binary tree
 
 
+.ft 5
 4 9 12 0 0 3 8 0 0 1 0 0 12 4 0 5 0 0 6 1 0 0 0
+.ft R
 
 Fig. 3.1(b) Its sequential representation
 .DE

doc/ego/ic/ic3

@@ -21,12 +21,15 @@ The syntactic structure of every component
 is described by a set of context free syntax rules,
 with the following conventions:
 .DS
-x               a non-terminal symbol
-A               a terminal symbol (in capitals)
-x: a b c;       a grammar rule
-a | b           a or b
-(a)+            1 or more occurrences of a
-{a}             0 or more occurrences of a
+.TS
+l l.
+x	a non-terminal symbol
+A	a terminal symbol (in capitals)
+x: a b c;	a grammar rule
+a | b	a or b
+(a)+	1 or more occurrences of a
+{a}	0 or more occurrences of a
+.TE
 .DE
 .NH 3
 The object table
@@ -70,21 +73,24 @@ identifying number
 (see previous section for their use).
 .DS
 .UL syntax
-  object_table:
-                {datablock} ;
-  datablock:
-                D_ID            -- unique identifying number
-                PSEUDO          -- one of ROM,CON,BSS,HOL,UNKNOWN
-                SIZE            -- # bytes declared
-                FLAGS
-                {value}         -- contents of rom
-                {object} ;      -- objects of the datablock
-  object:
-                O_ID            -- unique identifying number
-                OFFSET          -- offset within the datablock
-                SIZE ;          -- size of the object in bytes
-  value:
-                argument ;
+.TS
+lw(1i) l l.
+object_table:
+	{datablock} ;
+datablock:
+	D_ID	-- unique identifying number
+	PSEUDO	-- one of ROM,CON,BSS,HOL,UNKNOWN
+	SIZE	-- # bytes declared
+	FLAGS
+	{value}	-- contents of rom
+	{object} ;	-- objects of the datablock
+object:
+	O_ID	-- unique identifying number
+	OFFSET	-- offset within the datablock
+	SIZE ;	-- size of the object in bytes
+value:
+	argument ;
+.TE
 .DE
 A data block has only one flag: "external", indicating
 whether the data label is externally visible.
@@ -102,26 +108,29 @@ The table has one entry for
 every procedure.
 .DS
 .UL syntax
-  procedure_table:
-                {procedure}
-  procedure:
-                P_ID            -- unique identifying number
-                #LABELS         -- number of instruction labels
-                #LOCALS         -- number of bytes for locals 
-		#FORMALS        -- number of bytes for formals
-                FLAGS           -- flag bits
-                calling         -- procedures called by this one
-                change          -- info about global variables changed
-                use ;           -- info about global variables used
-  calling:
-                {P_ID} ;        -- procedures called
-  change:
-                ext             -- external variables changed
-                FLAGS ;
-  use:
-                FLAGS ;
-  ext:
-                {O_ID} ;        -- a set of objects
+.TS
+lw(1i) l l.
+procedure_table:
+	{procedure}
+procedure:
+	P_ID	-- unique identifying number
+	#LABELS	-- number of instruction labels
+	#LOCALS	-- number of bytes for locals 
+	#FORMALS	-- number of bytes for formals
+	FLAGS	-- flag bits
+	calling	-- procedures called by this one
+	change	-- info about global variables changed
+	use ;	-- info about global variables used
+calling:
+	{P_ID} ;	-- procedures called
+change:
+	ext	-- external variables changed
+	FLAGS ;
+use:
+	FLAGS ;
+ext:
+	{O_ID} ;	-- a set of objects
+.TE
 .DE
 .PP
 The number of bytes of formal parameters accessed by
@@ -231,38 +240,41 @@ of arguments), then the list is terminated by a special
 argument of type CEND.
 .DS
 .UL syntax
-  em_text:
-                {line} ;
-  line:
-                INSTR           -- opcode
-                OPTYPE          -- operand type
-                operand ;
-  operand:
-                empty |         -- OPTYPE = NO
-                SHORT |         -- OPTYPE = SHORT
-                OFFSET |        -- OPTYPE = OFFSET
-                LAB_ID |        -- OPTYPE = INSTRLAB
-                O_ID |          -- OPTYPE = OBJECT
-                P_ID |          -- OPTYPE = PROCEDURE
-                {argument} ;    -- OPTYPE = LIST
-  argument:
-                ARGTYPE
-                arg ;
-  arg:
-                empty |         -- ARGTYPE = CEND
-                OFFSET |
-                LAB_ID |
-                O_ID |
-                P_ID |
-                string |        -- ARGTYPE = STRING
-                const ;         -- ARGTYPE = ICON,UCON or FCON
-  string:
-                LENGTH          -- number of characters
-                {CHARACTER} ;
-  const:
-                SIZE            -- number of bytes
-                string ;        -- string representation of (un)signed
-                                -- or floating point constant
+.TS
+lw(1i) l l.
+em_text:
+	{line} ;
+line:
+	INSTR	-- opcode
+	OPTYPE	-- operand type
+	operand ;
+operand:
+	empty |	-- OPTYPE = NO
+	SHORT |	-- OPTYPE = SHORT
+	OFFSET |	-- OPTYPE = OFFSET
+	LAB_ID |	-- OPTYPE = INSTRLAB
+	O_ID |	-- OPTYPE = OBJECT
+	P_ID |	-- OPTYPE = PROCEDURE
+	{argument} ;	-- OPTYPE = LIST
+argument:
+	ARGTYPE
+	arg ;
+arg:
+	empty |	-- ARGTYPE = CEND
+	OFFSET |
+	LAB_ID |
+	O_ID |
+	P_ID |
+	string |	-- ARGTYPE = STRING
+	const ;	-- ARGTYPE = ICON,UCON or FCON
+string:
+	LENGTH	-- number of characters
+	{CHARACTER} ;
+const:
+	SIZE	-- number of bytes
+	string ;	-- string representation of (un)signed
+		-- or floating point constant
+.TE
 .DE
 .NH 3
 The control flow graphs
@@ -306,24 +318,27 @@ the identifiers of every
 that the block belongs to (see next section for loops).
 .DS
 .UL syntax
-  control_flow_graph:
-                {basic_block} ;
-  basic_block:
-                B_ID            -- unique identifying number
-                #INSTR          -- number of EM instructions
-                succ
-                pred
-                idom            -- immediate dominator
-                loops           -- set of loops
-		FLAGS ;         -- flag bits
-  succ:
-                {B_ID} ;
-  pred:
-                {B_ID} ;
-  idom:
-                B_ID ;
-  loops:
-                {LP_ID} ;
+.TS
+lw(1i) l l.
+control_flow_graph:
+	{basic_block} ;
+basic_block:
+	B_ID	-- unique identifying number
+	#INSTR	-- number of EM instructions
+	succ
+	pred
+	idom	-- immediate dominator
+	loops	-- set of loops
+	FLAGS ;	-- flag bits
+succ:
+	{B_ID} ;
+pred:
+	{B_ID} ;
+idom:
+	B_ID ;
+loops:
+	{LP_ID} ;
+.TE
 .DE
 The flag bits can have the values 'firm' and 'strong',
 which are explained below.
@@ -387,28 +402,30 @@ strong nor firm, as it may be skipped during some iterations
 .DS
 loop
        if cond1 then
-	      ... -- this code will not
-		  -- result in a firm or strong block
+	      ... \kx-- this code will not
+		  \h'|\nxu'-- result in a firm or strong block
        end if;
        ...  -- strong (always executed)
        exit when cond2;
-       ...  -- firm (not executed on
-            -- last iteration).
+       ...  \kx-- firm (not executed on last iteration).
 end loop;
 
 Fig. 3.2 Example of firm and strong block
 .DE
 .DS
 .UL syntax
-  looptable:
-                {loop} ;
-  loop:
-                LP_ID           -- unique identifying number
-                LEVEL           -- loop nesting level
-                entry           -- loop entry block
-                end ;
-  entry:
-                B_ID ;
-  end:
-                B_ID ;
+.TS
+lw(1i) l l.
+looptable:
+	{loop} ;
+loop:
+	LP_ID	-- unique identifying number
+	LEVEL	-- loop nesting level
+	entry	-- loop entry block
+	end ;
+entry:
+	B_ID ;
+end:
+	B_ID ;
+.TE
 .DE

doc/ego/ic/ic4

@@ -57,24 +57,27 @@ indicating which part of the EM text belongs
 to that block.
 .DS
 .UL syntax
-  intermediate_code:
-                object_table_file
-                proctable_file
-                em_text_file
-                cfg_file ;
-  object_table_file:
-                LENGTH          -- number of objects
-                object_table ;
-  proctable_file:
-                LENGTH          -- number of procedures
-                procedure_table ;
-  em_text_file:
-                em_text ;
-  cfg_file:
-                {per_proc} ;    -- one for every procedure
-  per_proc:
-                BLENGTH         -- number of basic blocks
-                LLENGTH         -- number of loops
-                control_flow_graph
-                looptable ;
+.TS
+lw(1i) l l.
+intermediate_code:
+	object_table_file
+	proctable_file
+	em_text_file
+	cfg_file ;
+object_table_file:
+	LENGTH	-- number of objects
+	object_table ;
+proctable_file:
+	LENGTH	-- number of procedures
+	procedure_table ;
+em_text_file:
+	em_text ;
+cfg_file:
+	{per_proc} ;	-- one for every procedure
+per_proc:
+	BLENGTH	-- number of basic blocks
+	LLENGTH	-- number of loops
+	control_flow_graph
+	looptable ;
+.TE
 .DE

doc/ego/ic/ic5

@@ -93,8 +93,11 @@ Objects are recognized by looking at the operands
 of instructions that reference global data.
 If we come across the instructions:
 .DS
-LDE X+6         -- Load Double External
-LAE X+20        -- Load Address External
+.TS
+l l.
+LDE X+6	-- Load Double External
+LAE X+20	-- Load Address External
+.TE
 .DE
 we conclude that the data block
 preceded by the data label X contains an object

doc/ego/il/il3

@@ -139,10 +139,10 @@ procedure p (x:integer);
 begin
    x := 20;
 end;
-...
-a := 10;                a := 10;
-p(a);        --->       a := 20;
-write(a);               write(a);
+\&...
+a := 10;                \kxa := 10;
+p(a);        --->       \h'|\nxu'a := 20;
+write(a);               \h'|\nxu'write(a);
 .DE
 .IP 2.
 P changes any of the operands of the

doc/ego/il/il4

@@ -104,18 +104,21 @@ The following model was developed empirically.
 Assume procedure P calls procedure Q.
 The call takes place in basic block B.
 .DS
-ZP = # zero parameters
-CP = # constant parameters - ZP
-LN = Loop Nesting level (0 if outside any loop)
-F  = \fIif\fR # formal parameters of Q > 0 \fIthen\fR 1 \fIelse\fR 0
-FT = \fIif\fR Q falls through \fIthen\fR 1 \fIelse\fR 0
-S  = size(Q) - 1 - # inline_parameters - F
-L  = \fIif\fR # local variables of P > 0 \fIthen\fR 0 \fIelse\fR -1
-A  = CP + 2 * ZP
-N  = \fIif\fR LN=0 and P is never called from a loop \fIthen\fR 0 \fIelse\fR (LN+1)**2
-FM = \fIif\fR B is a firm block \fIthen\fR 2 \fIelse\fR 1
+.TS
+l l l.
+ZP	\&=	# zero parameters
+CP	\&=	# constant parameters - ZP
+LN	\&=	Loop Nesting level (0 if outside any loop)
+F	\&=	\fIif\fR # formal parameters of Q > 0 \fIthen\fR 1 \fIelse\fR 0
+FT	\&=	\fIif\fR Q falls through \fIthen\fR 1 \fIelse\fR 0
+S	\&=	size(Q) - 1 - # inline_parameters - F
+L	\&=	\fIif\fR # local variables of P > 0 \fIthen\fR 0 \fIelse\fR -1
+A	\&=	CP + 2 * ZP
+N	\&=	\fIif\fR LN=0 and P is never called from a loop \fIthen\fR 0 \fIelse\fR (LN+1)**2
+FM	\&=	\fIif\fR B is a firm block \fIthen\fR 2 \fIelse\fR 1
 
-pay_off = (100/S + FT + F + L + A) * N * FM
+pay_off	\&=	(100/S + FT + F + L + A) * N * FM
+.TE
 .DE
 S stands for the size increase of the program,
 which is slightly less than the size of Q.

doc/ego/il/il5

@@ -165,19 +165,25 @@ These calls are inherited from the called procedure.
 We will refer to these invocations as \fInested calls\fR
 (see Fig. 5.1).
 .DS
+.TS
+lw(2.5i) l.
 procedure p is
-begin                           .
-     a();                       .
-     b();                       .
+begin	.
+     a();	.
+     b();	.
 end;
+.TE
 
-procedure r is            procedure r is
-begin                     begin
-     x();                      x();
-     p();  -- in line          a();  -- nested call
-     y();                      b();  -- nested call
-end;                           y();
-                          end;
+.TS
+lw(2.5i) l.
+procedure r is	procedure r is
+begin	begin
+     x();	    x();
+     p();  -- in line	    a();  -- nested call
+     y();	    b();  -- nested call
+end;	    y();
+	end;
+.TE
 
 Fig. 5.1 Example of nested procedure calls
 .DE
@@ -224,11 +230,11 @@ All list traversals look like:
 traverse(list)
 {
     for (c = first(list); c != 0; c = CDR(c)) {
-	if (c is marked) {
-	    traverse(CAR(c));
-	} else {
-	    do something with c
-	}
+        if (c is marked) {
+            traverse(CAR(c));
+        } else {
+            do something with c
+        }
     }
 }
 .DE

doc/ego/il/il6

@@ -22,6 +22,6 @@ the driving routine for doing the substitution
 lower level routines that do certain modifications
 .IP 3_aux:
 implements auxiliary procedures used by subphase 3
-.IP aux
+.IP aux:
 implements auxiliary procedures used by several subphases.
 .LP

doc/ego/intro/head

@@ -1,7 +1,10 @@
 .ND
-.ll 80m
-.nr LL 80m
-.nr tl 78m
+.\".ll 80m
+.\".nr LL 80m
+.\".nr tl 78m
 .tr ~ 
 .ds >. .
-.ds [. " \[
+.ds >, ,
+.ds [. " [
+.ds .] ]
+.cs 5 22

doc/ego/intro/tail

@@ -1,3 +1,17 @@
+.SH
+Acknowledgements
+.PP
+The author would like to thank Andy Tanenbaum for his guidance,
+Duk Bekema for implementing the Common Subexpression Elimination phase
+and writing the initial documentation of that phase,
+Dick Grune for reading the manuscript of this report
+and Ceriel Jacobs, Ed Keizer, Martin Kersten, Hans van Staveren
+and the members of the S.T.W. user's group for their
+interest and assistance.
+.bp
+.SH
+References
+.LP
 .[
 $LIST$
 .]

doc/ego/ov/ov1

@@ -76,11 +76,14 @@ EM is the assembly code of a virtual \fIstack machine\fR.
 All operations are performed on the top of the stack.
 For example, the statement "A := B + 3" may be expressed in EM as:
 .DS
-LOL -4         -- push local variable B
-LOC 3          -- push constant 3
-ADI 2          -- add two 2-byte items on top of
-	       -- the stack and push the result
-STL -2         -- pop A
+.TS
+l l.
+LOL -4	-- push local variable B
+LOC 3	-- push constant 3
+ADI 2	-- add two 2-byte items on top of
+	-- the stack and push the result
+STL -2	-- pop A
+.TE
 .DE
 So EM is essentially a \fIpostfix\fR code.
 .PP
@@ -139,7 +142,7 @@ We will give two methods to do this.
 .PP
 In "C" the notorious library routines "setjmp" and "longjmp"
 .[
-unix programmer's manual
+unix programmer's manual McIlroy
 .]
 may be used to jump out of a procedure,
 but can also be used for a number of other stuffy purposes,
@@ -298,9 +301,9 @@ optimizations; the report also contains a lengthy (over 60 pages)
 bibliography.
 .PP
 The number of articles on optimization is quite impressive.
-The Lowrey and Medlock paper on the Fortran H compiler
+The Lowry and Medlock paper on the Fortran H compiler
 .[
-object code optimization
+object code optimization Lowry Medlock
 .]
 is a classical one.
 Other papers on global optimization are.

doc/ego/proto.make

@@ -0,0 +1,64 @@
+# $Id$
+
+#PARAMS         do not remove this line!
+
+SRC_DIR = $(SRC_HOME)/doc/ego
+
+REFS=-p $(SRC_DIR)/refs.opt -p $(SRC_DIR)/refs.stat -p $(SRC_DIR)/refs.gen
+REFFILES = $(SRC_DIR)/refs.opt $(SRC_DIR)/refs.stat $(SRC_DIR)/refs.gen
+INTRO=$(SRC_DIR)/intro/intro?
+OV=$(SRC_DIR)/ov/ov?
+IC=$(SRC_DIR)/ic/ic?
+CF=$(SRC_DIR)/cf/cf?
+IL=$(SRC_DIR)/il/il?
+SR=$(SRC_DIR)/sr/sr?
+CS=$(SRC_DIR)/cs/cs?
+SP=$(SRC_DIR)/sp/sp?
+UD=$(SRC_DIR)/ud/ud?
+LV=$(SRC_DIR)/lv/lv?
+CJ=$(SRC_DIR)/cj/cj?
+BO=$(SRC_DIR)/bo/bo?
+RA=$(SRC_DIR)/ra/ra?
+CA=$(SRC_DIR)/ca/ca?
+EGO=$(INTRO) $(OV) $(IC) $(CF) $(IL) $(SR) $(CS) $(SP) $(CJ) $(BO) \
+    $(UD) $(LV) $(RA) $(CA)
+REFER=refer
+TROFF=troff
+TBL=tbl
+TARGET=-Tlp
+HEAD = $(SRC_DIR)/intro/head
+TAIL = $(SRC_DIR)/intro/tail
+
+$(TARGET_HOME)/doc/ego.doc:	$(REFFILES) $(HEAD) $(TAIL) $(EGO)
+	 $(REFER) -sA+T -l4,2 $(REFS) $(HEAD) $(EGO) $(TAIL) | $(TBL) > $(TARGET_HOME)/doc/ego.doc
+
+ego.f:	$(REFFILES) $(HEAD) $(TAIL) $(EGO)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(EGO) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ego.f
+intro.f:	$(REFFILES) $(HEAD) $(TAIL) $(INTRO)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(INTRO) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > intro.f
+ov.f:	$(REFFILES) $(HEAD) $(TAIL) $(OV)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(OV) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ov.f
+ic.f:	$(REFFILES) $(HEAD) $(TAIL) $(IC)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(IC) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ic.f
+cf.f:	$(REFFILES) $(HEAD) $(TAIL) $(CF)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(CF) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > cf.f
+il.f:	$(REFFILES) $(HEAD) $(TAIL) $(IL)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(IL) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > il.f
+sr.f:	$(REFFILES) $(HEAD) $(TAIL) $(SR)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(SR) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > sr.f
+cs.f:	$(REFFILES) $(HEAD) $(TAIL) $(CS)
+	 $(REFER)	-sA+T -l4,2 $(REFS) $(HEAD) $(CS) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > cs.f
+sp.f:	$(REFFILES) $(HEAD) $(TAIL) $(SP)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(SP) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > sp.f
+cj.f:	$(REFFILES) $(HEAD) $(TAIL) $(CJ)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(CJ) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > cj.f
+bo.f:	$(REFFILES) $(HEAD) $(TAIL) $(BO)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(BO) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > bo.f
+ud.f:	$(REFFILES) $(HEAD) $(TAIL) $(UD)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(UD) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ud.f
+lv.f:	$(REFFILES) $(HEAD) $(TAIL) $(LV)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(LV) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > lv.f
+ra.f:	$(REFFILES) $(HEAD) $(TAIL) $(RA)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(RA) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ra.f
+ca.f:	$(REFFILES) $(HEAD) $(TAIL) $(CA)
+	 $(REFER)  -sA+T -l4,2 $(REFS) $(HEAD) $(CA) $(TAIL) | $(TBL) | $(TROFF) $(TARGET) -ms > ca.f

doc/ego/ra/ra3

@@ -225,9 +225,12 @@ allocation.
 To summarize, the number of bytes a certain allocation would
 save is computed as follows:
 .DS
-net_bytes_saved =  bytes_saved - init_cost
-bytes_saved =      #occurrences * gains_per_occ
-init_cost =        #initializations * costs_per_init
+.TS
+l l.
+net_bytes_saved =	bytes_saved - init_cost
+bytes_saved =	#occurrences * gains_per_occ
+init_cost =	#initializations * costs_per_init
+.TE
 .DE
 .PP
 It is inherently more difficult to estimate the execution

doc/ego/sp/sp1

@@ -11,12 +11,15 @@ the stack by the \fIcalling\fR procedure.
 The ASP (Adjust Stack Pointer) instruction is used for this purpose.
 A call in EM is shown in Fig. 8.1
 .DS
-Pascal:                EM:
+.TS
+l l.
+Pascal:	EM:
 
-f(a,2)                 LOC 2
-		       LOE A
-		       CAL F
-		       ASP 4    -- pop 4 bytes
+f(a,2)	LOC 2
+	LOE A
+	CAL F
+	ASP 4    -- pop 4 bytes
+.TE
 
 Fig. 8.1 An example procedure call in Pascal and EM
 .DE
@@ -35,17 +38,20 @@ A stack adjustment may be delayed if there is some other stack adjustment
 later on in the same basic block.
 The two ASPs can be combined into one.
 .DS
-Pascal:           EM:               optimized EM:
+.TS
+l l l.
+Pascal:	EM:	optimized EM:
 
-f(a,2)            LOC 2             LOC 2
-g(3,b,c)          LOE A             LOE A
-		  CAL F             CAL F
-		  ASP 4             LOE C
-		  LOE C             LOE B
-		  LOE B             LOC 3
-		  LOC 3             CAL G
-		  CAL G             ASP 10
-		  ASP 6
+f(a,2)	LOC 2	LOC 2
+g(3,b,c)	LOE A	LOE A
+	CAL F	CAL F
+	ASP 4	LOE C
+	LOE C	LOE B
+	LOE B	LOC 3
+	LOC 3	CAL G
+	CAL G	ASP 10
+	ASP 6
+.TE
 
 Fig. 8.2 An example of local Stack Pollution
 .DE
@@ -85,19 +91,23 @@ the number of bytes pushed since the first ASP.
 .LP
 Condition 1. is not satisfied in Fig. 8.3.
 .DS
-Pascal:               EM:
+.TS
+l l.
+Pascal:	EM:
+
+5 + f(10) + g(30)	LOC 5
+	LOC 10
+	CAL F
+	ASP 2    -- cannot be removed
+	LFR 2    -- push function result
+	ADI 2
+	LOC 30
+	CAL G
+	ASP 2
+	LFR 2
+	ADI 2
+.TE
 
-5 + f(10) + g(30)     LOC 5
-		      LOC 10
-		      CAL F
-		      ASP 2    -- cannot be removed
-		      LFR 2    -- push function result
-		      ADI 2
-		      LOC 30
-		      CAL G
-		      ASP 2
-		      LFR 2
-		      ADI 2
 Fig. 8.3 An illegal transformation
 .DE
 If the first ASP were removed (delayed), the first ADI would add
@@ -105,19 +115,22 @@ If the first ASP were removed (delayed), the first ADI would add
 .sp
 Condition 2. is not satisfied in Fig. 8.4.
 .DS
-Pascal:               EM:
+.TS
+l l.
+Pascal:	EM:
 
-f(10) + 5 * g(30)     LOC 10
-		      CAL F
-		      ASP 2
-		      LFR 2
-		      LOC 5
-		      LOC 30
-		      CAL G
-		      ASP 2
-		      LFR 2
-		      MLI 2   --  5 * g(30)
-		      ADI 2
+f(10) + 5 * g(30)	LOC 10
+	CAL F
+	ASP 2
+	LFR 2
+	LOC 5
+	LOC 30
+	CAL G
+	ASP 2
+	LFR 2
+	MLI 2   --  5 * g(30)
+	ADI 2
+.TE
 
 Fig. 8.4 A second illegal transformation
 .DE

doc/ego/sr/sr1

@@ -16,13 +16,16 @@ done by the EM Peephole Optimizer.
 Strength reduction can also be applied
 more generally to operators used in a loop.
 .DS
-i := 1;                    i := 1;
-while i < 100 loop  -->    TMP := i * 118;
-   put(i * 118);           while i < 100 loop
-   i := i + 1;                put(TMP);
-end loop;                     i := i + 1;
-			      TMP := TMP + 118;
-			   end loop;
+.TS
+l l.
+i := 1;	i := 1;
+while i < 100 loop\ \ \ \ \ \ \ -->	TMP := i * 118;
+   put(i * 118);	while i < 100 loop
+   i := i + 1;	   put(TMP);
+end loop;	   i := i + 1;
+	   TMP := TMP + 118;
+	end loop;
+.TE
 
 Fig. 6.1 An example of Strenght Reduction
 .DE

doc/ego/sr/sr2

@@ -105,11 +105,11 @@ iv_expression * constant
 .IP (2)
 constant * iv_expression
 .IP (3)
-A[iv-expression] :=       (assign to array element)
+A[iv-expression] :=       \kx(assign to array element)
 .IP (4)
-A[iv-expression]          (use array element)
+A[iv-expression]          \h'|\nxu'(use array element)
 .IP (5)
-& A[iv-expression]        (take address of array element)
+& A[iv-expression]        \h'|\nxu'(take address of array element)
 .LP
 (Note that EM has different instructions to use an array element,
 store into one, or take the address of one, resp. LAR, SAR, and AAR).
@@ -171,10 +171,13 @@ replaced by TMP.
 For array optimizations, the replacement
 depends on the form:
 .DS
-\fIform\fR                         \fIreplacement\fR
-(3) A[iv-expr] :=            *TMP :=     (assign indirect)
-(4) A[iv-expr]               *TMP        (use indirect)
-(5) &A[iv-expr]              TMP
+.TS
+l l l.
+\fIform\fR	\fIreplacement\fR
+(3) A[iv-expr] :=	*TMP :=	(assign indirect)
+(4) A[iv-expr]	*TMP	(use indirect)
+(5) &A[iv-expr]	TMP
+.TE
 .DE
 The '*' denotes the indirect operator. (Note that
 EM has different instructions to do
@@ -199,14 +202,17 @@ must be negated.
 .PP
 The transformations are demonstrated by an example.
 .DS
-i := 100;                     i := 100;
-while i > 1 loop              TMP := (6-i) * 5;
-   X := (6-i) * 5 + 2;        while i > 1 loop
-   Y := (6-i) * 5 - 8;   -->     X := TMP + 2;
-   i := i - 3;                   Y := TMP - 8;
-end loop;                        i := i - 3;
-			         TMP := TMP + 15;
-			      end loop;
+.TS
+l l.
+i := 100;	i := 100;
+while i > 1 loop	TMP := (6-i) * 5;
+   X := (6-i) * 5 + 2;	while i > 1 loop
+   Y := (6-i) * 5 - 8;\ \ \ \ \ \ \ -->	   X := TMP + 2;
+   i := i - 3;	   Y := TMP - 8;
+end loop;	   i := i - 3;
+	   TMP := TMP + 15;
+	end loop;
+.TE
 
 Fig. 6.2 Example of complex Strength Reduction transformations
 .DE

doc/ego/sr/sr3

@@ -64,12 +64,15 @@ The assignment must match one of the EM patterns below.
 ('x' is the candidate. 'ws' is the word size of the target machine.
 'n' is any number.)
 .DS
-\fIpattern\fR                                     \fIstep size\fR
-INL x  |                                      +1
-DEL x  |                                      -1
-LOL x ; (INC | DEC) ; STL x  |                +1 | -1
-LOL x ; LOC n ; (ADI ws | SBI ws) ; STL x  |  +n | -n
-LOC n ; LOL x ; ADI ws ; STL x.               +n
+.TS
+l l.
+\fIpattern\fR	\fIstep size\fR
+INL x  |	+1
+DEL x  |	-1
+LOL x ; (INC | DEC) ; STL x  |	+1 | -1
+LOL x ; LOC n ; (ADI ws | SBI ws) ; STL x  |	+n | -n
+LOC n ; LOL x ; ADI ws ; STL x	+n
+.TE
 .DE
 From the patterns the step size of the induction variable
 can also be determined.
@@ -95,19 +98,22 @@ code in front of it.
 If an expression is to be optimized, it must
 be generated by the following syntax rules.
 .DS
-   optimizable_expr:
-		iv_expr const mult |
-		const iv_expr mult |
-		address iv_expr address array_instr;
-   mult:
-		MLI ws |
-		MLU ws ;
-   array_instr:
-		LAR ws |
-		SAR ws |
-		AAR ws ;
-   const:
-		LOC n ;
+.TS
+l l.
+optimizable_expr:
+	iv_expr const mult |
+	const iv_expr mult |
+	address iv_expr address array_instr;
+mult:
+	MLI ws |
+	MLU ws ;
+array_instr:
+	LAR ws |
+	SAR ws |
+	AAR ws ;
+const:
+	LOC n ;
+.TE
 .DE
 An 'address' is an EM instruction that loads an
 address on the stack.
@@ -120,36 +126,42 @@ instructions like LDL are an 'address'.
 denote resp. the array address and the
 array descriptor address).
 .DS
-   address:
-		LAE |
-		LAL |
-		LOL if ps=ws |
-		LOE    ,,    |
-		LIL    ,,    |
-		LDL if ps=2*ws |
-		LDE    ,,      ;
+.TS
+l l.
+address:
+	LAE |
+	LAL |
+	LOL if ps=ws |
+	LOE    ,,    |
+	LIL    ,,    |
+	LDL if ps=2*ws |
+	LDE    ,,      ;
+.TE
 .DE
 The notion of an iv-expression was introduced earlier.
 .DS
-   iv_expr:
-		iv_expr unair_op |
-		iv_expr iv_expr binary_op |
-		loopconst |
-		iv ;
-   unair_op:
-		NGI ws |
-		INC |
-		DEC ;
-   binary_op:
-		ADI ws |
-		ADU ws |
-		SBI ws |
-		SBU ws ;
-   loopconst:
-		const |
-		LOL x  if x is not changed in loop ;
-   iv:
-		LOL x  if x is an induction variable ;
+.TS
+l l.
+iv_expr:
+	iv_expr unair_op |
+	iv_expr iv_expr binary_op |
+	loopconst |
+	iv ;
+unair_op:
+	NGI ws |
+	INC |
+	DEC ;
+binary_op:
+	ADI ws |
+	ADU ws |
+	SBI ws |
+	SBU ws ;
+loopconst:
+	const |
+	LOL x  if x is not changed in loop ;
+iv:
+	LOL x  if x is an induction variable ;
+.TE
 .DE
 An iv_expression must satisfy one additional constraint:
 it must use exactly one operand that is an induction

doc/em/.distr

@@ -1,9 +1,7 @@
-Makefile
+proto.make
 READ_ME
-addend.n
 app.codes.nr
 app.exam.nr
-app.int.nr
 assem.nr
 cont.nr
 descr.nr
@@ -21,8 +19,6 @@ mach.nr
 macr.nr
 mapping.nr
 mem.nr
-print
-show
 title.nr
 traps.nr
 types.nr

doc/em/Makefile

@@ -1,36 +0,0 @@
-HOME=../..
-
-TBL=tbl
-NROFF=nroff
-SUF=pr
-
-head:   ../em.$(SUF)
-
-FILES = macr.nr title.nr intro.nr mem.nr ispace.nr dspace.nr mapping.nr \
-	types.nr descr.nr env.nr traps.nr mach.nr assem.nr \
-	app.int.nr app.codes.nr app.exam.nr cont.nr
-
-IOP=$(HOME)/util/ass/ip_spec.t#			# to construct itables from
-
-../em.$(SUF):	$(FILES) itables dispatdummy em.i Makefile
-		$(TBL) $(FILES) | $(NROFF) > ../em.$(SUF)
-
-app.codes.pr: app.codes.nr itables dispatdummy
-
-itables: $(IOP) ip.awk
-	awk -f ip.awk $(IOP) | sed 's/-/\\-/g' | $(TBL) >itables
-
-dispatdummy:	$(IOP) mkdispatch
-	mkdispatch < $(IOP) > dispatdummy
-	sed -f dispat1.sed < dispatdummy | $(TBL) > dispat1
-	sed -f dispat2.sed < dispatdummy | $(TBL) > dispat2
-	sed -f dispat3.sed < dispatdummy | $(TBL) > dispat3
-
-mkdispatch:	mkdispatch.c
-	cc -I$(HOME)/util/ass -I$(HOME)/h -o mkdispatch mkdispatch.c $(HOME)/lib/em_data.a
-
-.SUFFIXES : .pr .nr
-.nr.pr: ; $(TBL) macr.nr $*.nr | $(NROFF) >$@
-
-clean:
-	rm -f *.pr itables *.out dispatdummy dispat? *.o mkdispatch

doc/em/READ_ME

@@ -3,7 +3,4 @@ DESCRIPTION OF A MACHINE ARCHITECTURE FOR USE WITH BLOCK STRUCTURED LANGUAGES
 
 The file em.i (text of the defining interpreter) was hand-edited from int/em.p
 
-To print, set NROFF and TBL in the Makefile and call  make.
-It uses the kun macro package which is also distributed.
-
 The directory int contains the interpreter.

doc/em/app.codes.nr

@@ -1,4 +1,4 @@
-.BP
+.bp
 .AP "EM CODE TABLES"
 The following table is used by the assembler for EM machine
 language.
@@ -10,63 +10,66 @@ Each line describes a range of interpreter opcodes by
 specifying for which instruction the range is used, the type of the
 opcodes (mini, shortie, etc..) and range for the instruction
 argument.
-.A
+.QQ
 The first field on each line gives the EM instruction mnemonic,
 the second field gives some flags.
 If the opcodes are minis or shorties the third field specifies
 how many minis/shorties are used.
 The last field gives the number of the (first) interpreter
 opcode.
-.N 1
+.LP
 Flags :
-.IS 3
-.N 1
+.IP ""
 Opcode type, only one of the following may be specified.
-.PS - 5 "  "
-.PT \-
+.RS
+.IP \-
 opcode without argument
-.PT m
+.IP m
 mini
-.PT s
+.IP s
 shortie
-.PT 2
+.IP 2
 opcode with 2-byte signed argument
-.PT 4
+.IP 4
 opcode with 4-byte signed argument
-.PT 8
+.IP 8
 opcode with 8-byte signed argument
-.PE
+.IP u
+opcode with 2-byte unsigned argument
+.RE
+.IP ""
 Secondary (escaped) opcodes.
-.PS - 5 "  "
-.PT e
+.RS
+.IP e
 The opcode thus marked is in the secondary opcode group instead
 of the primary
-.PE
+.RE
+.IP ""
 restrictions on arguments
-.PS - 5 "  "
-.PT N
+.RS
+.IP N
 Negative arguments only
-.PT P
+.IP P
 Positive and zero arguments only
-.PE
+.RE
+.IP ""
 mapping of arguments
-.PS - 5 "  "
-.PT w
+.RS
+.IP w
 argument must be divisible by the wordsize and is divided by the
 wordsize before use as opcode argument.
-.PT o
+.IP o
 argument ( possibly after division ) must be >= 1 and is
 decremented before use as opcode argument
-.PE
-.IE
+.RE
+.LP
 If the opcode type is 2,4 or 8 the resulting argument is used as
 opcode argument (least significant byte first).
-.N
 If the opcode type is mini, the argument is added
 to the first opcode \- if in range \- .
 If the argument is negative, the absolute value minus one is
 used in the algorithm above.
-.N
+.br
 For shorties with positive arguments the first opcode is used
 for arguments in the range 0..255, the second for the range
 256..511, etc..
@@ -76,30 +79,32 @@ for arguments in the range \-1..\-256, the second for the range
 The byte following the opcode contains the least significant
 byte of the argument.
 First some examples of these specifications.
-.PS - 5
-.PT "aar mwPo 1 34"
+.IP "aar mwPo 1 34"
+.br
 Indicates that opcode 34 is used as a mini for Positive
 instruction arguments only.
 The w and o indicate division and decrementing of the
 instruction argument.
-Because the resulting argument must be zero ( only opcode 34 may be used
-), this mini can only be used for instruction argument 2.
+Because the resulting argument must be zero ( only opcode 34 may be used),
+this mini can only be used for instruction argument 2.
 Conclusion: opcode 34 is for "AAR 2".
-.PT "adp sP 1 41"
+.IP "adp sP 1 41"
+.br
 Opcode 41 is used as shortie for ADP with arguments in the range
 0..255.
-.PT "bra sN 2 60"
+.IP "bra sN 2 60"
+.br
 Opcode 60 is used as shortie for BRA with arguments \-1..\-256,
 61 is used for arguments \-257..\-512.
-.PT "zer e\- 145"
+.IP "zer e\- 145"
+.br
 Escaped opcode 145 is used for ZER.
-.PE
+.LP
 The interpreter opcode table:
-.N 1
-.IS 3
+.DS
 .so itables
-.IE
-.P
+.DE
+.PP
 The table above results in the following dispatch tables.
 Dispatch tables are used by interpreters to jump to the
 routines implementing the EM instructions, indexed by the next opcode.
@@ -108,46 +113,41 @@ of eight consecutive opcodes, preceded by the first opcode number
 on that line.
 Routine names consist of an EM mnemonic followed by a suffix.
 The suffices show the encoding used for each opcode.
-.N
+.LP
 The following suffices exist:
-.N 1
-.VS 1 0
-.IS 4
-.PS - 11
-.PT .z
-no arguments
-.PT .l
-16-bit argument
-.PT .lw
-16-bit argument divided by the wordsize
-.PT .p
-positive 16-bit argument
-.PT .pw
-positive 16-bit argument divided by the wordsize
-.PT .n
-negative 16-bit argument
-.PT .nw
-negative 16-bit argument divided by the wordsize
-.PT .s<num>
-shortie with <num> as high order argument byte
-.PT .w<num>
-shortie with argument divided by the wordsize
-.PT .<num>
-mini with <num> as argument
-.PT .<num>W
-mini with <num>*wordsize as argument
-.PE 1
+.TS
+tab(:);
+l l.
+.z:no arguments
+.l:16-bit argument
+.L:32-bit argument
+.u:16-bit unsigned argument
+.lw:16-bit argument divided by the wordsize
+.Lw:32-bit argument divided by the wordsize
+.p:positive 16-bit argument
+.P:positive 32-bit argument
+.pw:positive 16-bit argument divided by the wordsize
+.Pw:positive 32-bit argument divided by the wordsize
+.n:negative 16-bit argument
+.N:negative 32-bit argument
+.nw:negative 16-bit argument divided by the wordsize
+.Nw:negative 32-bit argument divided by the wordsize
+.s<num>:shortie with <num> as high order argument byte
+.w<num>:shortie with argument divided by the wordsize
+.<num>:mini with <num> as argument
+.<num>W:mini with <num>*wordsize as argument
+.TE
+.LP
 <num> is a possibly negative integer.
-.VS 1 1
-.IE
+.LP
 The dispatch table for the 256 primary opcodes:
-.N 1
+.sp 1
 .so dispat1
-.N 2
+.sp 2
 The list of secondary opcodes (escape1):
-.N 1
+.sp 1
 .so dispat2
-.N 2
+.sp 2
 Finally, the list of opcodes with four byte arguments (escape2).
-.N 1
+.sp 1
 .so dispat3

doc/em/app.exam.nr

@@ -1,7 +1,7 @@
-.BP
+.bp
 .AP "AN EXAMPLE PROGRAM"
-.A 1 0
-.NA
+.PP
+.na
 .ta 4n 8n 12n 16n 20n
 .nf
  1	program example(output);
@@ -45,12 +45,12 @@
 39		test(r)
 40	end.
 .fi
-.AD
-.BP
+.ad
+.bp
 The EM code as produced by the Pascal-VU compiler is given below. Comments
 have been added manually.  Note that this code has already been  optimized.
-.A 1 0
-.NA
+.LP
+.na
 .nf
 .ta 1n 24n
 	mes 2,2,2	; wordsize 2, pointersize 2
@@ -141,7 +141,7 @@ have been added manually.  Note that this code has already been  optimized.
 	lol 0
 	adp 2
 	sti 8	; r.r2 :=
-	lni	; lin 23 prior to optimization
+	lni	; lin 30 prior to optimization
 	lal \-224
 	lol \-4
 	lae .2
@@ -176,7 +176,7 @@ have been added manually.  Note that this code has already been  optimized.
 	sti 8	; r2 := x + y
 	loc 0
 	sil \-226	; r1 := 0
-	lin 34	; note the abscence of the unnecesary jump
+	lin 34	; note the absence of the unnecessary jump
 	lae 22	; address of output structure
 	lol \-4
 	cal $_wri	; write integer with default width
@@ -231,14 +231,13 @@ have been added manually.  Note that this code has already been  optimized.
 	end 0
 	mes 5	; reals were used
 .fi
-.AD
-.A 1 0
+.ad
+.PP
 The compact code corresponding to the above program is listed below.
 Read it horizontally, line by line, not column by column.
 Each number represents a byte of compact code, printed in decimal.
 The first two bytes form the magic word.
-.N 1
-.IS 3
+.LP
 .Dr 33
  173   0 159 122 122 122 255 242   1 161 250 124 116  46 112   0
  255 156 245  40   2 245   0 128 120 155 249 123 115 117 109 160
@@ -274,4 +273,3 @@ The first two bytes form the magic word.
  116   8 122  69 120  20 249 124  95 104 108 116   8 122 152 120
  159 124 160 255 159 125 255
 .De
-.IE

doc/em/app.int.nr

@@ -1,8 +0,0 @@
-.BP
-.AP "EM INTERPRETER"
-.nf
-.ft CW
-.ta 8 16 24 32 40 48 56 64 72 80
-.so em.i
-.ft P
-.fi

doc/em/assem.nr

@@ -1,6 +1,6 @@
-.BP
-.SN 11
-.S1 "EM ASSEMBLY LANGUAGE"
+.bp
+.P1 "EM ASSEMBLY LANGUAGE"
+.PP
 We use two representations for assembly language programs,
 one is in ASCII and the other is the compact assembly language.
 The latter needs less space than the first for the same program
@@ -16,7 +16,8 @@ The last part lists the EM instructions with the type of
 arguments allowed and an indication of the function.
 Appendix A gives a detailed description of the effect of all
 instructions in the form of a Pascal program.
-.S2 "ASCII assembly language"
+.P2 "ASCII assembly language"
+.PP
 An assembly language program consists of a series of lines, each
 line may be blank, contain one (pseudo)instruction or contain one
 label.
@@ -25,13 +26,13 @@ Upper case is used in this
 document merely to distinguish keywords from the surrounding prose.
 Comment is allowed at the end of each line and starts with a semicolon ";".
 This kind of comment does not exist in the compact form.
-.A
+.QQ
 Labels must be placed all by themselves on a line and start in
 column 1.
 There are two kinds of labels, instruction and data labels.
 Instruction labels are unsigned positive integers.
 The scope of an instruction label is its procedure.
-.A
+.QQ
 The pseudoinstructions CON, ROM and BSS may be preceded by a
 line containing a
 1\-8 character data label, the first character of which is a
@@ -46,13 +47,13 @@ These labels are considered as a special case and handled
 more efficiently in compact assembly language (see below).
 Note that a data label on its own or two consecutive labels are not
 allowed.
-.P
+.PP
 Each statement may contain an instruction mnemonic or pseudoinstruction.
 These must begin in column 2 or later (not column 1) and must be followed
 by a space, tab, semicolon or LF.
 Everything on the line following a semicolon is
 taken as a comment.
-.P
+.PP
 Each input file contains one module.
 A module may contain many procedures,
 which may be nested.
@@ -62,14 +63,15 @@ collection of instructions and pseudoinstructions and finally an END
 statement.
 Pseudoinstructions are also allowed between procedures.
 They do not belong to a specific procedure.
-.P
+.PP
 All constants in EM are interpreted in the decimal base.
 The ASCII assembly language accepts constant expressions
 wherever constants are allowed.
 The operators recognized are: +, \-, *, % and / with the usual
 precedence order.
 Use of the parentheses ( and ) to alter the precedence order is allowed.
-.S3 "Instruction arguments"
+.P3 "Instruction arguments"
+.PP
 Unlike many other assembly languages, the EM assembly
 language requires all arguments of normal and pseudoinstructions
 to be either a constant or an identifier, but not a combination
@@ -87,7 +89,7 @@ It is not allowed to add or subtract from instruction labels or procedure
 identifiers,
 which certainly is not a severe restriction and greatly aids
 optimization.
-.P
+.PP
 Instruction arguments can be constants,
 data labels, data labels offsetted by a constant, instruction
 labels and procedure identifiers.
@@ -98,7 +100,7 @@ that fit in a word.
 Arguments used as offsets to pointers should fit in a
 pointer-sized integer.
 Finally, arguments to LDC should fit in a double-word integer.
-.P
+.PP
 Several instructions have two possible forms:
 with an explicit argument and with an implicit argument on top of the stack.
 The size of the implicit argument is the wordsize.
@@ -109,7 +111,7 @@ integers on top of the stack are to be compared.
 on top of the stack that specifies the size of the integers to
 be compared.
 Thus the following two sequences are equivalent:
-.N 1
+.KS
 .TS
 center, tab(:) ;
 l r 30 l r.
@@ -118,16 +120,18 @@ LDL:\-14:LDL:\-14
 ::LOC:4
 CMI:4:CMI:
 ZEQ:*1:ZEQ:*1
-.TE 1
+.TE
+.KE
 Section 11.1.6 shows the arguments allowed for each instruction.
-.S3 "Pseudoinstruction arguments"
+.P3 "Pseudoinstruction arguments"
+.PP
 Pseudoinstruction arguments can be divided in two classes:
 Initializers and others.
 The following initializers are allowed: signed integer constants,
 unsigned integer constants, floating-point constants, strings,
 data labels, data labels offsetted by a constant, instruction
 labels and procedure identifiers.
-.P
+.PP
 Constant initializers in BSS, HOL, CON and ROM pseudoinstructions
 can be followed by a letter I, U or F.
 This indicator
@@ -142,10 +146,9 @@ As in instruction arguments, initializers include expressions of the form:
 \&"LABEL+offset" and "LABEL\-offset".
 The offset must be an unsigned decimal constant.
 The 'IUF' indicators cannot be used in the offsets.
-.P
+.PP
 Data labels are referred to by their name.
-.P
-
+.PP
 Strings are surrounded by double quotes (").
 Semicolon's in string do not indicate the start of comment.
 In the ASCII representation the escape character \e (backslash)
@@ -153,7 +156,6 @@ alters the meaning of subsequent character(s).
 This feature allows inclusion of zeroes, graphic characters and
 the double quote in the string.
 The following escape sequences exist:
-.DS
 .TS
 center, tab(:);
 l l l.
@@ -166,9 +168,8 @@ backslash:\e:\e\e
 double quote:":\e"
 bit pattern:\fBddd\fP:\e\fBddd\fP
 .TE
-.DE
 The escape \fB\eddd\fP consists of the backslash followed by 1,
-2, or 3 octal digits specifing the value of
+2, or 3 octal digits specifying the value of
 the desired character.
 If the character following a backslash is not one of those
 specified,
@@ -176,17 +177,18 @@ the backslash is ignored.
 Example: CON "hello\e012\e0".
 Each string element initializes a single byte.
 The ASCII character set is used to map characters onto values.
-.P
+.PP
 Instruction labels are referred to as *1, *2, etc.  in both branch
 instructions and as initializers.
-.P
+.PP
 The notation $procname means the identifier for the procedure
 with the specified name.
 This identifier has the size of a pointer.
-.S3 Notation
+.P3 Notation
+.PP
 First, the notation used for the arguments, classes of
 instructions and pseudoinstructions.
-.IS 2
+.DS
 .TS
 tab(:);
 l l l.
@@ -204,18 +206,19 @@ l l l.
 <...>+:\&=:one or more of <...>
 [...]:\&=:optional ...
 .TE
-.IE
-.S3 "Pseudoinstructions"
-.S4 Storage declaration
+.DE
+.P3 "Pseudoinstructions"
+.P4 "Storage declaration"
+.PP
 Initialized global data is allocated by the pseudoinstruction CON,
 which needs at least one argument.
 Each argument is used to allocate and initialize a number of
-consequtive bytes in data memory.
+consecutive bytes in data memory.
 The number of bytes to be allocated and the alignment depend on the type
 of the argument.
 For each argument, an integral number of words,
 determined by the argument type, is allocated and initialized.
-.P
+.PP
 The pseudoinstruction ROM is the same as CON,
 except that it guarantees that the initialized words
 will not change during the execution of the program.
@@ -223,7 +226,7 @@ This information allows optimizers to do
 certain calculations such as array indexing and
 subrange checking at compile time instead
 of at run time.
-.P
+.PP
 The pseudoinstruction BSS allocates
 uninitialized global data or large blocks of data initialized
 by the same value.
@@ -239,14 +242,14 @@ the second byte by 1 etc. in assembly language.
 The assembler/loader adds the base address of
 the HOL block to these numbers to obtain the
 absolute address in the machine language.
-.P
+.PP
 The scope of a HOL block starts at the HOL pseudo and
 ends at the next HOL pseudo or at the end of a module
 whatever comes first.
 Each instruction falls in the scope of at most one
 HOL block, the current HOL block.
 It is not allowed to have more than one HOL block per procedure.
-.P
+.PP
 The alignment restrictions are enforced by the
 pseudoinstructions.
 All initializers are aligned on a multiple of their size or the wordsize
@@ -257,52 +260,51 @@ Switching to another type of fragment or placing a label forces
 word-alignment.
 There are three types of fragments in global data space: CON, ROM and
 BSS/HOL.
-.N 2
-.IS 2
-.PS - 4
-.PT "BSS <cst1>,<val>,<cst2>"
+.IP "BSS <cst1>,<val>,<cst2>"
+.br
 Reserve <cst1> bytes.
 <val> is the value used to initialize the area.
 <cst1> must be a multiple of the size of <val>.
 <cst2> is 0 if the initialization is not strictly necessary,
 1 if it is.
-.PT "HOL <cst1>,<val>,<cst2>"
+.IP "HOL <cst1>,<val>,<cst2>"
+.br
 Idem, but all following absolute global data references will
 refer to this block.
 Only one HOL is allowed per procedure,
 it has to be placed before the first instruction.
-.PT "CON <val>+"
+.IP "CON <val>+"
+.br
 Assemble global data words initialized with the <val> constants.
-.PT "ROM <val>+"
+.IP "ROM <val>+"
+.br
 Idem, but the initialized data will never be changed by the program.
-.PE
-.IE
-.S4 Partitioning
+.P4 "Partitioning"
+.PP
 Two pseudoinstructions partition the input into procedures:
-.IS 2
-.PS - 4
-.PT "PRO <pro>[,<cst>]"
+.IP "PRO <pro>[,<cst>]"
+.br
 Start of procedure.
 <pro> is the procedure name.
 <cst> is the number of bytes for locals.
 The number of bytes for locals must be specified in the PRO or
 END pseudoinstruction.
 When specified in both, they must be identical.
-.PT "END  [<cst>]"
+.IP "END  [<cst>]"
+.br
 End of Procedure.
 <cst> is the number of bytes for locals.
 The number of bytes for locals must be specified in either the PRO or
 END pseudoinstruction or both.
-.PE
-.IE
-.S4 Visibility
+.P4 "Visibility"
+.PP
 Names of data and procedures in an EM module can either be
 internal or external.
 External names are known outside the module and are used to link
 several pieces of a program.
 Internal names are not known outside the modules they are used in.
 Other modules will not 'see' an internal name.
-.A
+.QQ
 To reduce the number of passes needed,
 it must be known at the first occurrence whether
 a name is internal or external.
@@ -312,46 +314,51 @@ If the first occurrence of a name is a reference,
 the name is considered to be external.
 If the first occurrence is in one of the following pseudoinstructions,
 the effect of the pseudo has precedence.
-.IS 2
-.PS - 4
-.PT "EXA <dlb>"
+.IP "EXA <dlb>"
+.br
 External name.
 <dlb> is known, possibly defined, outside this module.
 Note that <dlb> may be defined in the same module.
-.PT "EXP <pro>"
+.IP "EXP <pro>"
+.br
 External procedure identifier.
 Note that <pro> may be defined in the same module.
-.PT "INA <dlb>"
+.IP "INA <dlb>"
+.br
 Internal name.
 <dlb> is internal to this module and must be defined in this module.
-.PT "INP <pro>"
+.IP "INP <pro>"
+.br
 Internal procedure.
 <pro> is internal to this module and must be defined in this module.
-.PE
-.IE
-.S4 Miscellaneous
+.P4 "Miscellaneous"
+.PP
 Two other pseudoinstructions provide miscellaneous features:
-.IS 2
-.PS - 4
-.PT "EXC <cst1>,<cst2>"
+.IP "EXC <cst1>,<cst2>"
+.br
 Two blocks of instructions preceding this one are
 interchanged before being processed.
 <cst1> gives the number of lines of the first block.
 <cst2> gives the number of lines of the second one.
 Blank and pure comment lines do not count.
-.PT "MES <cst>[,<par>]*"
+This instruction is obsolete. Its use is strongly discouraged.
+.IP "MES <cst>[,<par>]*"
+.br
 A special type of comment.
 Used by compilers to communicate with the
 optimizer, assembler, etc. as follows:
-.VS 1 0
-.PS - 4
-.PT "MES 0"
+.RS
+.IP "MES 0"
+.br
 An error has occurred, stop further processing.
-.PT "MES 1"
+.IP "MES 1"
+.br
 Suppress optimization.
-.PT "MES 2,<cst1>,<cst2>"
+.IP "MES 2,<cst1>,<cst2>"
+.br
 Use wordsize <cst1> and pointer size <cst2>.
-.PT "MES 3,<cst1>,<cst2>,<cst3>,<cst4>"
+.IP "MES 3,<cst1>,<cst2>,<cst3>,<cst4>"
+.br
 Indicates that a local variable is never referenced indirectly.
 Used to indicate that a register may be used for a specific
 variable.
@@ -360,51 +367,57 @@ and offset from LB if negative.
 <cst2> gives the size of the variable.
 <cst3> indicates the class of the variable.
 The following values are currently recognized:
-.PS
-.PT 0
-The variable can be used for anything.
-.PT 1
-The variable is used as a loopindex.
-.PT 2
-The variable is used as a pointer.
-.PT 3
-The variable is used as a floating point number.
-.PE 0
+.br
+0\0\0\0The variable can be used for anything.
+.br
+1\0\0\0The variable is used as a loopindex.
+.br
+2\0\0\0The variable is used as a pointer.
+.br
+3\0\0\0The variable is used as a floating point number.
+.br
 <cst4> gives the priority of the variable,
 higher numbers indicate better candidates.
-.PT "MES 4,<cst>,<str>"
+.IP "MES 4,<cst>,<str>"
+.br
 Number of source lines in file <str> (for profiler).
-.PT "MES 5"
+.IP "MES 5"
+.br
 Floating point used.
-.PT "MES 6,<val>*"
+.IP "MES 6,<val>*"
+.br
 Comment.  Used to provide comments in compact assembly language.
-.PT "MES 7,....."
+.IP "MES 7,....."
+.br
 Reserved.
-.PT "MES 8,<pro>[,<dlb>]..."
+.IP "MES 8,<pro>[,<dlb>]..."
+.br
 Library module. Indicates that the module may only be loaded
 if it is useful, that is, if it can satisfy any unresolved
 references during the loading process.
 May not be preceded by any other pseudo, except MES's.
-.PT "MES 9,<cst>"
+.IP "MES 9,<cst>"
+.br
 Guarantees that no more than <cst> bytes of parameters are
 accessed, either directly or indirectly.
-.PT "MES 10,<cst>[,<par>]*
+.IP "MES 10,<cst>[,<par>]*
+.br
 This message number is reserved for the global optimizer.
 It inserts these messages in its output as hints to backends.
 <cst> indicates the type of hint.
-.PT "MES 11"
+.IP "MES 11"
+.br
 Procedures containing this message are possible destinations of
 non-local goto's with the GTO instruction.
 Some backends keep locals in registers,
 the locals in this procedure should not be kept in registers and
 all registers containing locals of other procedures should be
 saved upon entry to this procedure.
-.PE 1
-.VS 1 1
+.RE
+.IP ""
 Each backend is free to skip irrelevant MES pseudos.
-.PE
-.IE
-.S2 "The Compact Assembly Language"
+.P2 "The Compact Assembly Language"
+.PP
 The assembler accepts input in a highly encoded form.
 This
 form is intended to reduce the amount of file transport between the
@@ -413,16 +426,14 @@ and back ends, and also reduces the amount of storage required for storing
 libraries.
 Libraries are stored as archived compact assembly language, not machine
 language.
-.P
+.PP
 When beginning to read the input, the assembler is in neutral state, and
 expects either a label or an instruction (including the pseudoinstructions).
 The meaning of the next byte(s) when in neutral state is as follows, where
 b1, b2
 etc. represent the succeeding bytes.
-.N 1
-.DS
 .TS
-tab(:) ;
+tab(:);
 rw17 4 l.
 0:Reserved for future use
 1\-129:Machine instructions, see Appendix A, alphabetical list
@@ -432,37 +443,31 @@ rw17 4 l.
 180\-239:Instruction labels 0 \- 59  (180 is local label 0 etc.)
 240\-244:See the Common Table below
 245\-255:Not used
-.TE 1
-.DE 0
+.TE
 After a label, the assembler is back in neutral state; it can immediately
 accept another label or an instruction in the next byte.
 No linefeeds are used to separate lines.
-.P
+.PP
 If an opcode expects no arguments,
 the assembler is back in neutral state after
 reading the one byte containing the instruction number.
 If it has one or
 more arguments (only pseudos have more than 1), the arguments follow directly,
 encoded as follows:
-.N 1
-.IS 2
 .TS
 tab(:);
 r l.
 0\-239:Offsets from \-120 to 119
-
 240\-255:See the Common Table below
-.TE 1
+.TE
 Absence of an optional argument is indicated by a special
 byte.
-.IE 2
-.CS
-Common Table for Neutral State and Arguments
-.CE
 .TS
 tab(:);
+c s s s
 c c s c
-l8 l l8 l.
+l4 l l4 l.
+Common Table for Neutral State and Arguments
 class:bytes:description
 
 <ilb>:240:b1:Instruction label b1  (Not used for branches)
@@ -484,55 +489,51 @@ class:bytes:description
 <end>:255::Delimiter for argument lists or
 :::indicates absence of optional argument
 .TE 1
-.P
+.PP
 The bytes specifying the value of a 16, 32 or 64 bit constant
 are presented in two's complement notation, with the least
 significant byte first. For example: the value of a 32 bit
 constant is ((s4*256+b3)*256+b2)*256+b1, where s4 is b4\-256 if
 b4 is greater than 128 else s4 takes the value of b4.
-A <string> consists of a <cst> inmediatly followed by
+A <string> consists of a <cst> immediately followed by
 a sequence of bytes with length <cst>.
-.P
+.PP
 .ne 8
 The pseudoinstructions fall into several categories, depending on their
 arguments:
-.N 1
 .DS
- Group 1 \- EXC, BSS, HOL have a known number of arguments
- Group 2 \- EXA, EXP, INA, INP have a string as argument
- Group 3 \- CON, MES, ROM have a variable number of various things
- Group 4 \- END, PRO have a trailing optional argument.
-.DE 1
+Group 1 \- EXC, BSS, HOL have a known number of arguments
+Group 2 \- EXA, EXP, INA, INP have a string as argument
+Group 3 \- CON, MES, ROM have a variable number of various things
+Group 4 \- END, PRO have a trailing optional argument.
+.DE
 Groups 1 and 2
 use the encoding described above.
 Group 3 also uses the encoding listed above, with an <end> byte after the
 last argument to indicate the end of the list.
 Group 4 uses
 an <end> byte if the trailing argument is not present.
-.N 2
-.IS 2
 .TS
 tab(|);
 l s l
 l s s
-l 2 lw(46) l.
+l 2 lw(30) l.
 Example  ASCII|Example compact
 (LOC = 69, BRA = 18 here):
 
 2||182
 1||181
- LOC|10|69 130
- LOC|\-10|69 110
- LOC|300|69 245 44 1
- BRA|*19|18 139
+\0LOC|10|69 130
+\0LOC|\-10|69 110
+\0LOC|300|69 245 44 1
+\0BRA|*19|18 139
 300||241 44 1
 .3||242 3
- CON|4,9,*2,$foo|151 124 129 240 2 249 123 102 111 111 255
- CON|.35|151 242 35 255
-.TE 0
-.IE 0
-.S2 "Assembly language instruction list"
-.P
+\0CON|4,9,*2,$foo|151 124 129 240 2 249 123 102 111 111 255
+\0CON|.35|151 242 35 255
+.TE
+.P2 "Assembly language instruction list"
+.PP
 For each instruction in the list the range of argument values
 in the assembly language is given.
 The column headed \fIassem\fP contains the mnemonics defined
@@ -556,7 +557,7 @@ are indicated by letters:
 .ds z \fBz\fP
 .ds o \fBo\fP
 .ds - \fB\-\fP
-.N 1
+.sp
 .TS
 tab(:);
 c s l l
@@ -577,8 +578,8 @@ l l 15 l l.
 \&\*b:ilb:>= 0:label number
 \&\*r:cst:0,1,2:register number
 \&\*-:::no argument
-.TE 1
-.P
+.TE
+.PP
 The * at the rationale for \*w indicates that the argument
 can either be given as argument or on top of the stack.
 If the argument is omitted, the argument is fetched from the
@@ -587,7 +588,7 @@ it is assumed to be a wordsized unsigned integer.
 Instructions that check for undefined integer or floating-point
 values and underflow or overflow
 are indicated below by (*).
-.N 1
+.sp 1
 .DS
 .ta 12n
 GROUP 1 \- LOAD
@@ -684,7 +685,7 @@ GROUP 7 \- INCREMENT/DECREMENT/ZERO
   ZER \*w :	Load \*w zero bytes
 .DE
 
-.DS				\" ???
+.DS
 GROUP 8 \- CONVERT    (stack:	source, source size, dest. size (top))
 
   CII \*- :	Convert integer to integer (*)
@@ -741,7 +742,7 @@ GROUP 12 \- COMPARE
   TGT \*- :	True if greater, i.e. iff top of stack > 0
 .DE
 
-.DS				\" ???
+.DS
 GROUP 13 \- BRANCH
 
   BRA \*b :	Branch unconditionally to label \*b
@@ -798,4 +799,4 @@ GROUP 15 \- MISCELLANEOUS
   SIM \*- :	Store 16 bit ignore mask
   STR \*r :	Store register (0=LB, 1=SP, 2=HP)
   TRP \*- :	Cause trap to occur (Error number on stack)
-.DE 0
+.DE

doc/em/cont.nr

@@ -1,6 +1,4 @@
-.MS T A 0
-.ME
-.BP
-.MS B A 0
-.ME
-.CT
+.de PT
+..
+.bp
+.Ct

doc/em/descr.nr

@@ -1,69 +1,62 @@
-.SN 7
-.BP
-.S1 "DESCRIPTORS"
+.bp
+.P1 "DESCRIPTORS"
+.PP
 Several instructions use descriptors, notably the range check instruction,
 the array instructions, the goto instruction and the case jump instructions.
 Descriptors reside in data space.
 They may be constructed at run time, but
 more often they are fixed and allocated in ROM data.
-.P
+.PP
 All instructions using descriptors, except GTO, have as argument
 the size of the integers in the descriptor.
 All implementations have to allow integers of the size of a
 word in descriptors.
 All integers popped from the stack and used for indexing or comparing
 must have the same size as the integers in the descriptor.
-.S2 "Range check descriptors"
+.P2 "Range check descriptors"
+.PP
 Range check descriptors consist of two integers:
-.IS 2
-.PS 1 4 "" .
-.PT
-lower bound~~~~~~~signed
-.PT
-upper bound~~~~~~~signed
-.PE
-.IE
+.IP 1.
+lower bound	signed
+.IP 2.
+upper bound	signed
+.LP
 The range check instruction checks an integer on the stack against
 these bounds and causes a trap if the value is outside the interval.
 The value itself is neither changed nor removed from the stack.
-.S2 "Array descriptors"
+.P2 "Array descriptors"
+.PP
 Each array descriptor describes a single dimension.
 For multi-dimensional arrays, several array instructions are
 needed to access a single element.
 Array descriptors contain the following three integers:
-.IS 2
-.PS 1 4 "" .
-.PT
-lower bound~~~~~~~~~~~~~~~~~~~~~signed
-.PT
-upper bound \- lower bound~~~~~~~unsigned
-.PT
-number of bytes per element~~~~~unsigned
-.PE
-.IE
+.IP 1.
+lower bound		signed
+.IP 2.
+upper bound \- lower bound	unsigned
+.IP 3.
+number of bytes per element	unsigned
+.LP
 The array instructions LAR, SAR and AAR have the pointer to the start
 of the descriptor as operand on the stack.
-.sp
+.LP
 The element A[I] is fetched as follows:
-.IS 2
-.PS 1 4 "" .
-.PT
+.IP 1.
 Stack the address of A  (e.g., using LAE or LAL)
-.PT
+.IP 2.
 Stack the value of I (n-byte integer)
-.PT
+.IP 3.
 Stack the pointer to the descriptor (e.g., using LAE)
-.PT
+.IP 4.
 LAR n (n is the size of the integers in the descriptor and I)
-.PE
-.IE
+.LP
 All array instructions first pop the address of the descriptor
 and the index.
 If the index is not within the bounds specified, a trap occurs.
 If ok, (I~\-~lower bound) is multiplied
 by the number of bytes per element (the third word).  The result is added
 to the address of A and replaces A on the stack.
-.A
+.QQ
 At this point LAR, SAR and AAR diverge.
 AAR is finished.  LAR pops the address and fetches the data
 item,
@@ -71,30 +64,29 @@ the size being specified by the descriptor.
 The usual restrictions for memory access must be obeyed.
 SAR pops the address and stores the
 data item now exposed.
-.S2 "Non-local goto descriptors"
+.P2 "Non-local goto descriptors"
+.PP
 The GTO instruction provides a way of returning directly to any
 active procedure invocation.
 The argument of the instruction is the address of a descriptor
 containing three pointers:
-.IS 2
-.PS 1 4 "" .
-.PT
+.IP 1.
 value of PC after the jump
-.PT
+.IP 2.
 value of SP after the jump
-.PT
+.IP 3.
 value of LB after the jump
-.PE
-.IE
+.LP
 GTO replaces the loads PC, SP and LB from the descriptor,
 thereby jumping to a procedure
-and removing zeor or more frames from the stack.
+and removing zero or more frames from the stack.
 The LB, SP and PC in the descriptor must belong to a
 dynamically enclosing procedure,
 because some EM implementations will need to backtrack through
 the dynamic chain and use the implementation dependent data
 in frames to restore registers etc.
-.S2 "Case descriptors"
+.P2 "Case descriptors"
+.PP
 The case jump instructions CSA and CSB both
 provide multiway branches selected by a case index.
 Both fetch two operands from the stack:
@@ -106,7 +98,7 @@ Therefore, the descriptors for CSA and CSB,
 as shown in figure 4, are different.
 All pointers in the table must be addresses of instructions in the
 procedure executing the case instruction.
-.P
+.PP
 CSA selects the new PC by indexing.
 If the index, a signed integer, is greater than or equal to
 the lower bound and less than or equal to the upper bound,
@@ -116,23 +108,22 @@ The table does not contain the value of the upper bound,
 but the value of upper-lower as an unsigned integer.
 The default instruction pointer is used when the index is out of bounds.
 If the resulting PC is 0, then trap.
-.P
+.PP
 CSB selects the new PC by searching.
 The table is searched for an entry with index value equal to the case index.
 That entry or, if none is found, the default entry contains the
 new PC.
 When the resulting PC is 0, a trap is performed.
-.P
+.PP
 The choice of which case instruction to use for
 each source language case statement
 is up to the front end.
 If the range of the index value is dense, i.e
 .DS
 (highest value \- lowest value) / number of cases
-.DE 1
+.DE
 is less than some threshold, then CSA is the obvious choice.
 If the range is sparse, CSB is better.
-.N 2
 .Dr 30
    |--------------------|        |--------------------|  high address
    | pointer for upb    |        |    pointer n-1     |

doc/em/dspace.nr

@@ -1,6 +1,6 @@
-.BP
-.SN 4
-.S1 "DATA ADDRESS SPACE"
+.bp
+.P1 "DATA ADDRESS SPACE"
+.PP
 The data address space is divided into three parts, called 'areas',
 each with its own addressing method:
 global data area,
@@ -9,24 +9,24 @@ and heap data area.
 These data areas must be part of the same
 address space because all data is accessed by
 the same type of pointers.
-.P
+.PP
 Space for global data is reserved using several pseudoinstructions in the
 assembly language, as described in
 the next paragraph and chapter 11.
 The size of the global data area is fixed per program.
-.A
+.QQ
 Global data is addressed absolutely in the machine language.
 Many instructions are available to address global data.
 They all have an absolute address as argument.
 Examples are LOE, LAE and STE.
-.P
+.PP
 Part of the global data area is initialized by the
 compiler, the
 rest is not initialized at all or is initialized
 with a value, typically \-32768 or 0.
 Part of the initialized global data may be made read-only
 if the implementation supports protection.
-.P
+.PP
 The local data area is used as a stack,
 which grows from high to low addresses
 and contains some data for each active procedure
@@ -44,14 +44,14 @@ Variables in other active procedures are addressed by following
 the chain of statically enclosing procedures using the LXL or LXA instruction.
 The variables in dynamically enclosing procedures can be
 addressed with the use of the DCH instruction.
-.A
+.QQ
 Many instructions have offsets to LB as argument,
 for instance LOL, LAL and STL.
 The arguments of these instructions range from \-1 to some
 (negative) minimum
 for the access of local storage and from 0 to some (positive)
 maximum for parameter access.
-.P
+.PP
 The procedure call instructions CAL and CAI each create a new frame
 on the stack.
 Each procedure has an assembly-time parameter specifying
@@ -62,7 +62,7 @@ Each procedure, therefore, starts with a stack with the local variables
 already allocated.
 The return instructions RET and RTT remove a frame.
 The actual parameters must be removed by the calling procedure.
-.P
+.PP
 RET may copy some words from the stack of
 the returning procedure to an unnamed 'function return area'.
 This area is available for 'READ-ONCE' access using the LFR instruction.
@@ -70,7 +70,7 @@ The result of a LFR is only defined if the size used to fetch
 is identical to the size used in the last return.
 The instruction ASP, used to remove the parameters from the
 stack, the branch instruction BRA and the non-local goto
-instrucion GTO are the only ones that leave the contents of
+instruction GTO are the only ones that leave the contents of
 the 'function return area' intact.
 All other instructions are allowed to destroy the function
 return area.
@@ -86,7 +86,7 @@ area is twice the pointer size,
 because we want to be able to handle 'procedure instance
 identifiers' which consist of a procedure identifier and the LB
 of a frame belonging to that procedure.
-.P
+.PP
 The heap data area grows upwards, to higher numbered
 addresses.
 It is initially empty.
@@ -96,7 +96,8 @@ The heap pointer may be manipulated
 by the LOR and STR instructions.
 The heap can only be addressed indirectly,
 by pointers derived from previous values of HP.
-.S2 "Global data area"
+.P2 "Global data area"
+.PP
 The initial size of the global data area is determined at assembly time.
 Global data is allocated by several
 pseudoinstructions in the EM assembly
@@ -109,7 +110,7 @@ under certain conditions, several blocks are allocated
 in a single fragment.
 This guarantees that the bytes of these blocks
 are consecutive.
-.P
+.PP
 Global data is addressed absolutely in binary
 machine language.
 Most compilers, however,
@@ -124,7 +125,7 @@ It is the task of the assembler/loader to
 translate these labels into absolute addresses.
 These labels may also be used
 in CON and ROM pseudoinstructions to initialize pointers.
-.P
+.PP
 The pseudoinstruction CON allocates initialized data.
 ROM acts like CON but indicates that the initialized data will
 not change during execution of the program.
@@ -134,7 +135,7 @@ data.
 The pseudoinstruction HOL is similar to BSS,
 but it alters the meaning of subsequent absolute addressing in
 the assembly language.
-.P
+.PP
 Another type of global data is a small block,
 called the ABS block, with an implementation defined size.
 Storage in this type of block can only be addressed
@@ -146,7 +147,7 @@ update this counter.
 A pointer at location 4 points to a string containing the
 current source file name.
 The instruction FIL can be used to update the pointer.
-.P
+.PP
 All numeric arguments of the instructions that address
 the global data area refer to locations in the
 ABS block unless
@@ -158,7 +159,7 @@ Thus LOE 0 loads the zeroth word of the most recent HOL, unless no HOL has
 appeared in the current file so
 far, in which case it loads the zeroth word of the
 ABS fragment.
-.P
+.PP
 The global data area is highly fragmented.
 The ABS block and each HOL and BSS block are separate fragments.
 The way fragments are formed from CON and ROM blocks is more complex.
@@ -169,12 +170,11 @@ allocated consecutively in a single fragment, unless
 these CON pseudos are separated in the assembly language program
 by a data label definition or one or more of the following pseudos:
 .DS
-
-     ROM, BSS, HOL and END
-
+ROM, BSS, HOL and END
 .DE
 An analogous rule holds for ROM pseudos.
-.S2 "Local data area"
+.P2 "Local data area"
+.PP
 The local data area consists of a sequence of frames, one for
 each active procedure.
 Below the frame of the current procedure resides the
@@ -183,17 +183,15 @@ Frames are generated by procedure calls and are
 removed by procedure returns.
 A procedure frame consists of six 'zones':
 .DS
-
-  1.  The return status block
-  2.  The local variables and compiler temporaries
-  3.  The register save block
-  4.  The dynamic local generators
-  5.  The operand stack.
-  6.  The parameters of a procedure one level deeper
-
+1.  The return status block
+2.  The local variables and compiler temporaries
+3.  The register save block
+4.  The dynamic local generators
+5.  The operand stack.
+6.  The parameters of a procedure one level deeper
 .DE
 A sample frame is shown in Figure 1.
-.P
+.PP
 Before a procedure call is performed the actual
 parameters are pushed onto the stack of the calling procedure.
 The exact details are compiler dependent.
@@ -216,11 +214,11 @@ These instructions assume that this parameter contains the LB of
 the statically enclosing procedure.
 Procedures that do not have a dynamically enclosing procedure
 do not need a static link at offset 0.
-.P
+.PP
 Two instructions are available to perform procedure calls, CAL
 and CAI.
 Several tasks are performed by these call instructions.
-.A
+.QQ
 First, a part of the status of the calling procedure is
 saved on the stack in the return status block.
 This block should contain the return address of the calling
@@ -235,12 +233,12 @@ The stack frames need not be contiguous then and the first
 status save area can contain the parameter base AB,
 which has the value of SP just after the last parameter has
 been pushed.
-.A
+.QQ
 Second, the LB is changed to point to the
 first word above the local variables.
 The new LB is a copy of the SP after the return status
 block has been pushed.
-.A
+.QQ
 Third, the amount of local storage needed by the procedure is
 reserved.
 The parameters and local storage are accessed by the same instructions.
@@ -256,28 +254,28 @@ The initial value of the allocated words is
 not defined, but implementations that check for undefined
 values will probably initialize them with a
 special 'undefined' pattern, typically \-32768.
-.A
+.QQ
 Fourth, any EM implementation is allowed to reserve a variable size
 block beneath the local variables.
 This block could, for example, be used to save a variable number
 of registers.
-.A
+.QQ
 Finally, the address of the entry point of the called procedure
 is loaded into the Program Counter.
-.P
+.PP
 The ASP instruction can be used to allocate further (dynamic)
 local storage.
 The base address of such storage must be obtained with a LOR~SP
 instruction.
 This same instruction ASP may also be used
 to remove some words from the stack.
-.P
+.PP
 There is a version of ASP, called ASS, which fetches the number
 of bytes to allocate from the stack.
 It can be used to allocate space for local
 objects whose size is unknown at compile time,
 so called 'dynamic local generators'.
-.P
+.PP
 Control is returned to the calling procedure with a RET instruction.
 Any return value is then copied to the 'function return area'.
 The frame created by the call is deallocated and the status of
@@ -293,7 +291,7 @@ Violating this restriction might result in hard to detect
 errors.
 The calling procedure has to remove the parameters from the stack.
 This can be done with the aforementioned ASP instruction.
-.P
+.PP
 Each procedure frame is a separate fragment.
 Because any fragment may be placed anywhere in memory,
 procedure frames need not be contiguous.
@@ -345,7 +343,8 @@ procedure frames need not be contiguous.
 .Df
 Figure 1. A sample procedure frame and parameters.
 .De
-.S2 "Heap data area"
+.P2 "Heap data area"
+.PP
 The heap area starts empty, with HP
 pointing to the low end of it.
 HP always contains a word address.
@@ -357,10 +356,10 @@ If it is smaller, then the heap shrinks.
 HP may never point below its original value.
 All words between the current HP and the original HP
 are allocated to the heap.
-The heap may not grow into a part of memory that is already allocated
-for the stack.
+The heap may not grow into a part of memory that is already allocated.
 When this is attempted, the STR instruction will cause a trap to occur.
-.P
+In this case, HP retains its old value.
+.PP
 The only way to address the heap is indirectly.
 Whenever an object is allocated by increasing HP,
 then the old HP value must be saved and can be used later to address
@@ -370,7 +369,7 @@ is no longer part of the heap, then an attempt to access
 the object is not allowed.
 Furthermore, if the heap pointer is increased again to above
 the object address, then access to the old object gives undefined results.
-.P
+.PP
 The heap is a single fragment.
 All bytes have consecutive addresses.
 No limits are imposed on the size of the heap as long as it fits

doc/em/em.i

@@ -1,3 +1,10 @@
+.bp
+.AP "EM INTERPRETER"
+.nf
+.ft CW
+.lg 0
+.nr x \w'        '
+.ta \nxu +\nxu +\nxu +\nxu +\nxu +\nxu +\nxu +\nxu +\nxu +\nxu
 
 { This  is an interpreter for EM.  It serves as  the official machine
   definition.  This interpreter must run on a machine which supports
@@ -159,7 +166,7 @@ var
   iclass: insclass;     { true for escaped opcodes }
   dispat: array[insclass,byte] of dispatch;
   retsize:size;         { holds size of last LFR }
-  insr: mnem;           { holds the instructionnumber }
+  insr: mnem;           { holds the instruction number }
   halted: boolean;      { normally false }
   exitstatus:word;      { parameter of MON 1 }
   ignmask:word;         { ignore mask for traps }
@@ -205,7 +212,8 @@ begin if (a<sp) or (a mod wsize<>0) then trap(ESTACK); lb:=a end;
 
 procedure newhp(a:adr);
 begin if (a>sp) or (a>maxdata+1) or (a mod wsize<>0)
-      then trap(EHEAP); hp:=a
+      then trap(EHEAP)
+      else hp:=a
 end;
 
 function argc(a:double):sword;
@@ -521,7 +529,7 @@ begin j:=0;
 end;
 
 {---------------------------------------------------------------------------}
-{                           Array indexing
+{                           Array indexing                                  }
 {---------------------------------------------------------------------------}
 
 function arraycalc(c:adr):adr; { subscript calculation }
@@ -866,6 +874,7 @@ begin
       begin
 	iflag:=f; instr:=insr;
 	if '2' in cset      then ilength:=2
+	else if 'u' in cset then ilength:=2
 	else if '4' in cset then ilength:=4
 	else if '8' in cset then ilength:=8
 	else if (mini in f) or (short in f) then
@@ -1664,3 +1673,6 @@ case insr of
   writeln('halt with exit status: ',exitstatus:1);
   doident;
 end.
+.ft P
+.lg 1
+.fi

doc/em/env.nr

@@ -1,56 +1,43 @@
-.SN 8
-.VS 1 0
-.BP
-.S1 "ENVIRONMENT INTERACTIONS"
+.bp
+.P1 "ENVIRONMENT INTERACTIONS"
+.PP
 EM programs can interact with their environment in three ways.
 Two, starting/stopping and monitor calls, are dealt with in this chapter.
 The remaining way to interact, interrupts, will be treated
 together with traps in chapter 9.
-.S2 "Program starting and stopping"
+.P2 "Program starting and stopping"
+.PP
 EM user programs start with a call to a procedure called
-m_a_i_n.
+_m_a_i_n.
 The assembler and backends look for the definition of a procedure
 with this name in their input.
 The call passes three parameters to the procedure.
 The parameters are similar to the parameters supplied by the
-UNIX
-.FS
-UNIX is a Trademark of Bell Laboratories.
-.FE
+.UX
 operating system to C programs.
-These parameters are often called
-.BW argc ,
-.B argv
-and
-.BW envp .
+These parameters are often called \fBargc\fP, \fBargv\fP and \fBenvp\fP.
 Argc is the parameter nearest to LB and is a wordsized integer.
 The other two are pointers to the first element of an array of
 string pointers.
-.N
-The
-.B argv
-array contains
-.B argc
+The \fBargv\fP array contains \fBargc\fP
 strings, the first of which contains the program call name.
-The other strings in the
-.B argv
+The other strings in the \fBargv\fP
 array are the program parameters.
-.P
-The
-.B envp
+.PP
+The \fBenvp\fP
 array contains strings in the form "name=string", where 'name'
 is the name of an environment variable and string its value.
-The
-.B envp
+The \fBenvp\fP
 is terminated by a zero pointer.
-.P
+.PP
 An EM user program stops if the program returns from the first
-invocation of m_a_i_n.
+invocation of _m_a_i_n.
 The contents of the function return area are used to procure a
 wordsized program return code.
 EM programs also stop when traps and interrupts occur that are
 not caught and when the exit monitor call is executed.
-.S2 "Input/Output and other monitor calls"
+.P2 "Input/Output and other monitor calls"
+.PP
 EM differs from most conventional machines in that it has high level i/o
 instructions.
 Typical instructions are OPEN FILE and READ FROM FILE instead
@@ -58,7 +45,7 @@ of low level instructions such as setting and clearing
 bits in device registers.
 By providing such high level i/o primitives, the task of implementing
 EM on various non EM machines is made considerably easier.
-.P
+.PP
 I/O is initiated by the MON instruction, which expects an iocode on top
 of the stack.
 Often there are also parameters which are pushed on the
@@ -68,45 +55,35 @@ Some i/o functions also provide results, which are returned on the stack.
 In the list of monitor calls we use several types of parameters and results,
 these types consist of integers and unsigneds of varying sizes, but never
 smaller than the wordsize, and the two pointer types.
-.N 1
+.LP
 The names of the types used are:
-.IS 4
-.PS - 10
-.PT int
-an integer of wordsize
-.PT int2
-an integer whose size is the maximum of the wordsize and 2
-bytes
-.PT int4
-an integer whose size is the maximum of the wordsize and 4
-bytes
-.PT intp
-an integer with the size of a pointer
-.PT uns2
-an unsigned integer whose size is the maximum of the wordsize and 2
-.PT unsp
-an unsigned integer with the size of a pointer
-.PT ptr
-a pointer into data space
-.PE 1
-.IE 0
+.DS
+.TS
+tab(:);
+l l.
+int:an integer of wordsize
+int2:an integer whose size is the maximum of the wordsize and 2 bytes
+int4:an integer whose size is the maximum of the wordsize and 4 bytes
+intp:an integer with the size of a pointer
+uns2:an unsigned integer whose size is the maximum of the wordsize and 2
+unsp:an unsigned integer with the size of a pointer
+ptr:a pointer into data space
+.TE
+.DE
+.LP
 The table below lists the i/o codes with their results and
 parameters.
 This list is similar to the system calls of the UNIX Version 7
 operating system.
-.A
+.QQ
 To execute a monitor call, proceed as follows:
-.IS 2
-.N 1
-.PS a 4 "" )
-.PT
+.IP a)
 Stack the parameters, in reverse order, last parameter first.
-.PT
+.IP b)
 Push the monitor call number (iocode) onto the stack.
-.PT
+.IP c)
 Execute the MON instruction.
-.PE 1
-.IE
+.LP
 An error code is present on the top of the stack after
 execution of most monitor calls.
 If this error code is zero, the call performed the action
@@ -117,94 +94,100 @@ This construction enables programs to test for failure with a
 single instruction (~TEQ or TNE~) and still find out the cause of
 the failure.
 The result name 'e' is reserved for the error code.
-.N 1
+.ne 5
+.LP
 List of monitor calls.
-.DS B
-.ta 2n 8n 16n 32n 48n
-number	name	parameters	results	function
+.LP
+.nf
+.na
+.ta 4n 13n 29n 52n
+nr	name	parameters	results	function
 
-	1	Exit	status:int		Terminate this process
-	2	Fork	e,flag,pid:int		Spawn new process
-	3	Read	fildes:int;buf:ptr;nbytes:unsp
-				e:int;rbytes:unsp	Read from file
-	4	Write	fildes:int;buf:ptr;nbytes:unsp
-				e:int;wbytes:unsp	Write on a file
-	5	Open	string:ptr;flag:int
-				e,fildes:int	Open file for read and/or write
-	6	Close	fildes:int	e:int	Close a file
-	7	Wait	e:int;status,pid:int2
-					Wait for child
-	8	Creat	string:ptr;mode:int
-				e,fildes:int	Create a new file
-	9	Link	string1,string2:ptr
-				e:int	Link to a file
-	10	Unlink	string:ptr	e:int	Remove directory entry
-	12	Chdir	string:ptr	e:int	Change default directory
-	14	Mknod	string:ptr;mode,addr:int2
-				e:int	Make a special file
-	15	Chmod	string:ptr;mode:int2
-				e:int	Change mode of file
-	16	Chown	string:ptr;owner,group:int2
-				e:int	Change owner/group of a file
-	18	Stat	string,statbuf:ptr
-				e:int	Get file status
-	19	Lseek	fildes:int;off:int4;whence:int
-				e:int;oldoff:int4	Move read/write pointer
-	20	Getpid	pid:int2		Get process identification
-	21	Mount	special,string:ptr;rwflag:int
-				e:int	Mount file system
-	22	Umount	special:ptr	e:int	Unmount file system
-	23	Setuid	userid:int2	e:int	Set user ID
-	24	Getuid	e_uid,r_uid:int2		Get user ID
-	25	Stime	time:int4	e:int	Set time and date
-	26	Ptrace	request:int;pid:int2;addr:ptr;data:int
-				e,value:int	Process trace
-	27	Alarm	seconds:uns2	previous:uns2	Schedule signal
-	28	Fstat	fildes:int;statbuf:ptr
-				e:int	Get file status
-	29	Pause	Stop until signal
-	30	Utime	string,timep:ptr
-				e:int	Set file times
-	33	Access	string:ptr;mode:int
-				e:int	Determine file accessibility
-	34	Nice	incr:int		Set program priority
-	35	Ftime	bufp:ptr	e:int	Get date and time
-	36	Sync			Update filesystem
-	37	Kill	pid:int2;sig:int
-				e:int	Send signal to a process
-	41	Dup	fildes,newfildes:int
-				e,fildes:int	Duplicate a file descriptor
-	42	Pipe	e,w_des,r_des:int	Create a pipe
-	43	Times	buffer:ptr		Get process times
-	44	Profil	buff:ptr;bufsiz,offset,scale:intp	Execution time profile
-	46	Setgid	gid:int2	e:int	Set group ID
-	47	Getgid	e_gid,r_gid:int		Get group ID
-	48	Sigtrp	trapno,signo:int
-				e,prevtrap:int	See below
-	51	Acct	file:ptr	e:int	Turn accounting on or off
-	53	Lock	flag:int	e:int	Lock a process
-	54	Ioctl	fildes,request:int;argp:ptr
-				e:int	Control device
-	56	Mpxcall	cmd:int;vec:ptr	e:int	Multiplexed file handling
-	59	Exece	name,argv,envp:ptr
-				e:int	Execute a file
-	60	Umask	complmode:int2	oldmask:int2	Set file creation mode mask
-	61	Chroot	string:ptr	e:int	Change root directory
-.DE 1
+1	Exit	status:int		Terminate this process
+2	Fork		e,flag,pid:int	Spawn new process
+3	Read	fildes:int;buf:ptr;nbytes:unsp
+			e:int;rbytes:unsp	Read from file
+4	Write	fildes:int;buf:ptr;nbytes:unsp
+			e:int;wbytes:unsp	Write on a file
+5	Open	string:ptr;flag:int
+			e,fildes:int	Open file for read and/or write
+6	Close	fildes:int	e:int	Close a file
+7	Wait		e:int;status,pid:int2
+				Wait for child
+8	Creat	string:ptr;mode:int
+			e,fildes:int	Create a new file
+9	Link	string1,string2:ptr
+			e:int	Link to a file
+10	Unlink	string:ptr	e:int	Remove directory entry
+12	Chdir	string:ptr	e:int	Change default directory
+14	Mknod	string:ptr;mode,addr:int2
+			e:int	Make a special file
+15	Chmod	string:ptr;mode:int2
+			e:int	Change mode of file
+16	Chown	string:ptr;owner,group:int2
+			e:int	Change owner/group of a file
+18	Stat	string,statbuf:ptr
+			e:int	Get file status
+19	Lseek	fildes:int;off:int4;whence:int
+			e:int;oldoff:int4	Move read/write pointer
+20	Getpid		pid:int2	Get process identification
+21	Mount	special,string:ptr;rwflag:int
+			e:int	Mount file system
+22	Umount	special:ptr	e:int	Unmount file system
+23	Setuid	userid:int2	e:int	Set user ID
+24	Getuid		e_uid,r_uid:int2	Get user ID
+25	Stime	time:int4	e:int	Set time and date
+26	Ptrace	request:int;pid:int2;addr:ptr;data:int
+			e,value:int	Process trace
+27	Alarm	seconds:uns2	previous:uns2	Schedule signal
+28	Fstat	fildes:int;statbuf:ptr
+			e:int	Get file status
+29	Pause			Stop until signal
+30	Utime	string,timep:ptr
+			e:int	Set file times
+33	Access	string:ptr;mode:int
+			e:int	Determine file accessibility
+34	Nice	incr:int		Set program priority
+35	Ftime	bufp:ptr	e:int	Get date and time
+36	Sync			Update filesystem
+37	Kill	pid:int2;sig:int
+			e:int	Send signal to a process
+41	Dup	fildes,newfildes:int
+			e,fildes:int	Duplicate a file descriptor
+42	Pipe		e,w_des,r_des:int	Create a pipe
+43	Times	buffer:ptr		Get process times
+44	Profil	buff:ptr;bufsiz,offset,scale:intp
+				Execution time profile
+46	Setgid	gid:int2	e:int	Set group ID
+47	Getgid		e_gid,r_gid:int	Get group ID
+48	Sigtrp	trapno,signo:int
+			e,prevtrap:int	See below
+51	Acct	file:ptr	e:int	Turn accounting on or off
+53	Lock	flag:int	e:int	Lock a process
+54	Ioctl	fildes,request:int;argp:ptr
+			e:int	Control device
+56	Mpxcall	cmd:int;vec:ptr	e:int	Multiplexed file handling
+59	Exece	name,argv,envp:ptr
+			e:int	Execute a file
+60	Umask	mask:int2	oldmask:int2	Set file creation mode mask
+61	Chroot	string:ptr	e:int	Change root directory
+.fi
+.ad
+.LP
 Codes 0, 11, 13, 17, 31, 32, 38, 39, 40, 45, 49, 50, 52,
 55, 57, 58, 62, and 63 are
 not used.
-.P
+.PP
 All monitor calls, except fork and sigtrp
 are the same as the UNIX version 7 system calls.
-.P
+.PP
 The sigtrp entry maps UNIX signals onto EM interrupts.
 Normally, trapno is in the range 0 to 252.
 In that case it requests that signal signo
 will cause trap trapno to occur.
 When given trap number \-2, default signal handling is reset, and when given
 trap number \-3, the signal is ignored.
-.P
+.PP
 The flag returned by fork is 1 in the child process and 0 in
 the parent.
 The pid returned is the process-id of the other process.

doc/em/exam.e

@@ -86,7 +86,7 @@
   lol 0
   adp 2
   sti 8                  ; r.r2 :=
-  lni                    ; was lin 23 prior to optimization
+  lni                    ; was lin 30 prior to optimization
   lal -224
   lol -4
   lae .2
@@ -121,7 +121,7 @@
   sti 8                  ; r2 := x + y
   loc 0
   sil -226               ; r1 := 0
-  lin 34                 ; note the abscence of the unnecesary jump
+  lin 34                 ; note the absence of the unnecessary jump
   lae 22                 ; address of output structure
   lol -4
   cal $_wri              ; write integer with default width