===================================================================
RCS file: /cvs/docbook2mdoc/docbook2mdoc.c,v
retrieving revision 1.10
retrieving revision 1.109
diff -u -p -r1.10 -r1.109
--- docbook2mdoc/docbook2mdoc.c	2014/03/29 10:56:21	1.10
+++ docbook2mdoc/docbook2mdoc.c	2019/04/12 10:34:48	1.109
@@ -1,6 +1,7 @@
-/*	$Id: docbook2mdoc.c,v 1.10 2014/03/29 10:56:21 kristaps Exp $ */
+/* $Id: docbook2mdoc.c,v 1.109 2019/04/12 10:34:48 schwarze Exp $ */
 /*
  * Copyright (c) 2014 Kristaps Dzonsons <kristaps@bsd.lv>
+ * Copyright (c) 2019 Ingo Schwarze <schwarze@openbsd.org>
  *
  * Permission to use, copy, modify, and distribute this software for any
  * purpose with or without fee is hereby granted, provided that the above
@@ -14,1195 +15,1116 @@
  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  */
-#include <sys/queue.h>
-
 #include <assert.h>
 #include <ctype.h>
-#include <expat.h>
-#include <fcntl.h>
-#include <getopt.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
-#include <unistd.h>
 
-/*
- * All recognised node types.
- */
-enum	nodeid {
-	NODE_ROOT = 0, /* Must comes first. */
-	/* Alpha-ordered hereafter. */
-	NODE_ARG,
-	NODE_CITEREFENTRY,
-	NODE_CMDSYNOPSIS,
-	NODE_CODE,
-	NODE_COMMAND,
-	NODE_FUNCDEF,
-	NODE_FUNCPROTOTYPE,
-	NODE_FUNCSYNOPSIS,
-	NODE_FUNCSYNOPSISINFO,
-	NODE_FUNCTION,
-	NODE_MANVOLNUM, 
-	NODE_OPTION,
-	NODE_PARA,
-	NODE_PARAMDEF,
-	NODE_PARAMETER,
-	NODE_PROGRAMLISTING,
-	NODE_REFCLASS,
-	NODE_REFDESCRIPTOR,
-	NODE_REFENTRY,
-	NODE_REFENTRYTITLE,
-	NODE_REFMETA,
-	NODE_REFMISCINFO,
-	NODE_REFNAME,
-	NODE_REFNAMEDIV,
-	NODE_REFPURPOSE,
-	NODE_REFSECT1,
-	NODE_REFSYNOPSISDIV,
-	NODE_STRUCTNAME,
-	NODE_SYNOPSIS,
-	NODE_TEXT, 
-	NODE_TITLE,
-	NODE__MAX
-};
+#include "node.h"
+#include "macro.h"
+#include "format.h"
 
 /*
- * Global parse state.
- * Keep this as simple and small as possible.
+ * The implementation of the mdoc(7) formatter.
  */
-struct	parse {
-	enum nodeid	 node; /* current (NODE_ROOT if pre-tree) */
-	int		 stop; /* should we stop now? */
-	struct pnode	*root; /* root of parse tree */
-	struct pnode	*cur; /* current node in tree */
-	char		*b; /* nil-terminated buffer for pre-print */
-	size_t		 bsz; /* current length of b */
-	size_t		 mbsz; /* max bsz allocation */
-	int		 newln; /* output: are we on a fresh line */
-};
 
-struct	node {
-	const char	*name; /* docbook element name */
-	unsigned int	 flags;
-#define	NODE_IGNTEXT	 1 /* ignore all contained text */
-};
+static void	 pnode_print(struct format *, struct pnode *);
 
-TAILQ_HEAD(pnodeq, pnode);
 
-struct	pnode {
-	enum nodeid	 node; /* node type */
-	char		*b; /* binary data buffer */
-	size_t		 bsz; /* data buffer size */
-	struct pnode	*parent; /* parent (or NULL if top) */
-	struct pnodeq	 childq; /* queue of children */
-	TAILQ_ENTRY(pnode) child;
-};
-
-static	const struct node nodes[NODE__MAX] = {
-	{ NULL, 0 }, 
-	{ "arg", 0 }, 
-	{ "citerefentry", NODE_IGNTEXT }, 
-	{ "cmdsynopsis", NODE_IGNTEXT }, 
-	{ "code", 0 }, 
-	{ "command", 0 }, 
-	{ "funcdef", 0 },
-	{ "funcprototype", NODE_IGNTEXT }, 
-	{ "funcsynopsis", NODE_IGNTEXT }, 
-	{ "funcsynopsisinfo", 0 }, 
-	{ "function", 0 }, 
-	{ "manvolnum", 0 }, 
-	{ "option", 0 }, 
-	{ "para", 0 }, 
-	{ "paramdef", 0 },
-	{ "parameter", 0 }, 
-	{ "programlisting", 0 }, 
-	{ "refclass", NODE_IGNTEXT }, 
-	{ "refdescriptor", NODE_IGNTEXT }, 
-	{ "refentry", NODE_IGNTEXT }, 
-	{ "refentrytitle", 0 }, 
-	{ "refmeta", NODE_IGNTEXT }, 
-	{ "refmiscinfo", NODE_IGNTEXT }, 
-	{ "refname", 0 }, 
-	{ "refnamediv", NODE_IGNTEXT }, 
-	{ "refpurpose", 0 }, 
-	{ "refsect1", 0 }, 
-	{ "refsynopsisdiv", NODE_IGNTEXT }, 
-	{ "structname", 0 }, 
-	{ "synopsis", 0 }, 
-	{ NULL, 0 }, 
-	{ "title", 0 }, 
-};
-
 static void
-pnode_print(struct parse *p, struct pnode *pn);
-
-/*
- * Look up whether "parent" is a valid parent for "node".
- * This is sucked directly from the DocBook specification: look at the
- * "children" and "parent" sections of each node.
- */
-static int
-isparent(enum nodeid node, enum nodeid parent)
+pnode_printtext(struct format *f, struct pnode *n)
 {
+	struct pnode	*nn;
+	char		*cp;
+	int		 accept_arg;
 
-	switch (node) {
-	case (NODE_ROOT):
-		return(0);
-	case (NODE_ARG):
-		switch (parent) {
-		case (NODE_ARG):
-		case (NODE_CMDSYNOPSIS):
-			return(1);
-		default:
-			break;
+	cp = n->b;
+	accept_arg = f->flags & FMT_ARG;
+	if (f->linestate == LINE_MACRO && !n->spc && !accept_arg) {
+		for (;;) {
+			if (*cp == '\0')
+				return;
+			if (strchr("!),.:;?]", *cp) == NULL)
+				break;
+			printf(" %c", *cp++);
 		}
-		return(0);
-	case (NODE_CITEREFENTRY):
-		switch (parent) {
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
+		if (isspace((unsigned char)*cp)) {
+			while (isspace((unsigned char)*cp))
+				cp++;
+			macro_close(f);
+		} else {
+			fputs(" Ns", stdout);
+			f->flags &= FMT_IMPL;
+			accept_arg = 1;
 		}
-		return(0);
-	case (NODE_CMDSYNOPSIS):
-		switch (parent) {
-		case (NODE_PARA):
-		case (NODE_REFSECT1):
-		case (NODE_REFSYNOPSISDIV):
-			return(1);
-		default:
-			break;
+	}
+	if (f->linestate == LINE_MACRO && !accept_arg &&
+	    (f->flags & (FMT_CHILD | FMT_IMPL)) == 0)
+		macro_close(f);
+
+	/*
+	 * Text preceding a macro without intervening whitespace
+	 * requires a .Pf macro.
+	 * Set the spacing flag to avoid a redundant .Ns macro.
+	 */
+
+	if (f->linestate != LINE_MACRO &&
+	    (nn = TAILQ_NEXT(n, child)) != NULL && nn->spc == 0 &&
+	    (nn->node != NODE_TEXT && nn->node != NODE_ESCAPE)) {
+		macro_open(f, "Pf");
+		accept_arg = 1;
+		f->flags |= FMT_CHILD;
+		nn->spc = 1;
+	}
+
+	switch (f->linestate) {
+	case LINE_NEW:
+		break;
+	case LINE_TEXT:
+		if (n->spc) {
+			if (n->node == NODE_TEXT)
+				macro_close(f);
+			else
+				putchar(' ');
 		}
-		return(0);
-	case (NODE_CODE):
-		switch (parent) {
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_COMMAND):
-		switch (parent) {
-		case (NODE_CMDSYNOPSIS):
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_FUNCDEF):
-		return(NODE_FUNCPROTOTYPE == parent);
-	case (NODE_FUNCPROTOTYPE):
-		return(NODE_FUNCSYNOPSIS == parent);
-	case (NODE_FUNCSYNOPSIS):
-		switch (parent) {
-		case (NODE_PARA):
-		case (NODE_REFSECT1):
-		case (NODE_REFSYNOPSISDIV):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_FUNCSYNOPSISINFO):
-		return(NODE_FUNCSYNOPSIS == parent);
-	case (NODE_FUNCTION):
-		switch (parent) {
-		case (NODE_CODE):
-		case (NODE_FUNCDEF):
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_MANVOLNUM):
-		switch (parent) {
-		case (NODE_CITEREFENTRY):
-		case (NODE_REFMETA):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_OPTION):
-		switch (parent) {
-		case (NODE_ARG):
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_PARA):
-		switch (parent) {
-		case (NODE_REFSECT1):
-		case (NODE_REFSYNOPSISDIV):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_PARAMDEF):
-		return(NODE_FUNCPROTOTYPE == parent);
-	case (NODE_PARAMETER):
-		switch (parent) {
-		case (NODE_CODE):
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_PARA):
-		case (NODE_PARAMDEF):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_PROGRAMLISTING):
-		switch (parent) {
-		case (NODE_PARA):
-		case (NODE_REFSECT1):
-		case (NODE_REFSYNOPSISDIV):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_REFCLASS):
-		return(parent == NODE_REFNAMEDIV);
-	case (NODE_REFDESCRIPTOR):
-		return(parent == NODE_REFNAMEDIV);
-	case (NODE_REFENTRY):
-		return(parent == NODE_ROOT);
-	case (NODE_REFENTRYTITLE):
-		switch (parent) {
-		case (NODE_CITEREFENTRY):
-		case (NODE_REFMETA):
-			return(1);
-		default:
-			break;
-		}
-	case (NODE_REFMETA):
-		return(parent == NODE_REFENTRY);
-	case (NODE_REFMISCINFO):
-		return(parent == NODE_REFMETA);
-	case (NODE_REFNAME):
-		return(parent == NODE_REFNAMEDIV);
-	case (NODE_REFNAMEDIV):
-		return(parent == NODE_REFENTRY);
-	case (NODE_REFPURPOSE):
-		return(parent == NODE_REFNAMEDIV);
-	case (NODE_REFSECT1):
-		return(parent == NODE_REFENTRY);
-	case (NODE_REFSYNOPSISDIV):
-		return(parent == NODE_REFENTRY);
-	case (NODE_STRUCTNAME):
-		switch (parent) {
-		case (NODE_CODE):
-		case (NODE_FUNCSYNOPSISINFO):
-		case (NODE_FUNCTION):
-		case (NODE_OPTION):
-		case (NODE_PARA):
-		case (NODE_PARAMETER):
-		case (NODE_PROGRAMLISTING):
-		case (NODE_REFDESCRIPTOR):
-		case (NODE_REFENTRYTITLE):
-		case (NODE_REFNAME):
-		case (NODE_REFPURPOSE):
-		case (NODE_SYNOPSIS):
-		case (NODE_TITLE):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_SYNOPSIS):
-		switch (parent) {
-		case (NODE_REFSYNOPSISDIV):
-		case (NODE_REFSECT1):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_TITLE):
-		switch (parent) {
-		case (NODE_REFSECT1):
-		case (NODE_REFSYNOPSISDIV):
-			return(1);
-		default:
-			break;
-		}
-		return(0);
-	case (NODE_TEXT):
-		return(1);
-	case (NODE__MAX):
 		break;
+	case LINE_MACRO:
+		if (accept_arg)
+			putchar(' ');
+		else
+			macro_close(f);
+		break;
 	}
 
-	abort();
-	return(0);
+	if (n->node == NODE_ESCAPE) {
+		fputs(n->b, stdout);
+		if (f->linestate == LINE_NEW)
+			f->linestate = LINE_TEXT;
+		return;
+	}
+
+	/*
+	 * Remove the prefix '-' from <option> elements
+	 * because the arguments of .Fl macros do not need it.
+	 */
+
+	if (n->parent != NULL && n->parent->node == NODE_OPTION && *cp == '-')
+		cp++;
+
+	if (f->linestate == LINE_MACRO)
+		macro_addarg(f, cp, 0);
+	else
+		print_text(f, cp, 0);
 }
 
-/*
- * Process a stream of characters.
- * We store text as nodes in and of themselves.
- * If a text node is already open, append to it.
- * If it's not open, open one under the current context.
- */
 static void
-xml_char(void *arg, const XML_Char *p, int sz)
+pnode_printpara(struct format *f, struct pnode *n)
 {
-	struct parse	*ps = arg;
-	struct pnode	*dat;
-	int		 i;
+	struct pnode	*np;
 
-	/* Stopped or no tree yet. */
-	if (ps->stop || NODE_ROOT == ps->node)
+	if (n->parent == NULL)
 		return;
 
-	/* Not supposed to be collecting text. */
-	assert(NULL != ps->cur);
-	if (NODE_IGNTEXT & nodes[ps->node].flags)
-		return;
+	if ((np = TAILQ_PREV(n, pnodeq, child)) == NULL)
+	    np = n->parent;
 
-	/*
-	 * Are we in the midst of processing text?
-	 * If we're not processing text right now, then create a text
-	 * node for doing so.
-	 * However, don't do so unless we have some non-whitespace to
-	 * process: strip out all leading whitespace to be sure.
-	 */
-	if (NODE_TEXT != ps->node) {
-		for (i = 0; i < sz; i++)
-			if ( ! isspace((int)p[i]))
-				break;
-		if (i == sz)
-			return;
-		p += i;
-		sz -= i;
-		dat = calloc(1, sizeof(struct pnode));
-		if (NULL == dat) {
-			perror(NULL);
-			exit(EXIT_FAILURE);
-		}
+	f->flags = 0;
 
-		dat->node = ps->node = NODE_TEXT;
-		dat->parent = ps->cur;
-		TAILQ_INIT(&dat->childq);
-		TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child);
-		ps->cur = dat;
-		assert(NULL != ps->root);
+	switch (np->node) {
+	case NODE_ENTRY:
+	case NODE_GLOSSTERM:
+	case NODE_LISTITEM:
+	case NODE_TERM:
+		return;
+	case NODE_APPENDIX:
+	case NODE_LEGALNOTICE:
+	case NODE_PREFACE:
+	case NODE_SECTION:
+		if (f->level < 3)
+			return;
+		break;
+	default:
+		break;
 	}
-
-	/* Append to current buffer. */
-	assert(sz >= 0);
-	ps->cur->b = realloc(ps->cur->b, 
-		ps->cur->bsz + (size_t)sz);
-	if (NULL == ps->cur->b) {
-		perror(NULL);
-		exit(EXIT_FAILURE);
-	}
-	memcpy(ps->cur->b + ps->cur->bsz, p, sz);
-	ps->cur->bsz += (size_t)sz;
+	macro_line(f, "Pp");
 }
 
+/*
+ * If the SYNOPSIS macro has a superfluous title, kill it.
+ */
 static void
-pnode_trim(struct pnode *pn)
+pnode_printrefsynopsisdiv(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc, *nn;
 
-	assert(NODE_TEXT == pn->node);
-	for ( ; pn->bsz > 0; pn->bsz--)
-		if ( ! isspace((int)pn->b[pn->bsz - 1]))
-			break;
+	TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn)
+		if (nc->node == NODE_TITLE)
+			pnode_unlink(nc);
+
+	macro_line(f, "Sh SYNOPSIS");
 }
 
 /*
- * Begin an element.
- * First, look for the element.
- * If we don't find it and we're not parsing, keep going.
- * If we don't find it and we're parsing, puke and exit.
- * If we find it but we're not parsing yet (i.e., it's not a refentry
- * and thus out of context), keep going.
- * If we find it and we're at the root and already have a tree, puke and
- * exit (FIXME: I don't think this is right?).
- * If we find it but we're parsing a text node, close out the text node,
- * return to its parent, and keep going.
- * Make sure that the element is in the right context.
- * Lastly, put the node onto our parse tree and continue.
+ * Start a hopefully-named `Sh' section.
  */
 static void
-xml_elem_start(void *arg, const XML_Char *name, const XML_Char **atts)
+pnode_printrefsect(struct format *f, struct pnode *n)
 {
-	struct parse	*ps = arg;
-	enum nodeid	 node;
-	struct pnode	*dat;
+	struct pnode	*nc;
+	const char	*title;
+	int		 flags, level;
 
-	if (ps->stop)
+	if (n->parent == NULL)
 		return;
 
-	/* Close out text node, if applicable... */
-	if (NODE_TEXT == ps->node) {
-		assert(NULL != ps->cur);
-		pnode_trim(ps->cur);
-		ps->cur = ps->cur->parent;
-		assert(NULL != ps->cur);
-		ps->node = ps->cur->node;
+	level = ++f->level;
+	flags = ARG_SPACE;
+	if (level == 1)
+		flags |= ARG_UPPER;
+	if (level < 3) {
+		switch (n->node) {
+		case NODE_CAUTION:
+		case NODE_NOTE:
+		case NODE_TIP:
+		case NODE_WARNING:
+			level = 3;
+			break;
+		default:
+			break;
+		}
 	}
 
-	for (node = 0; node < NODE__MAX; node++)
-		if (NULL == nodes[node].name)
-			continue;
-		else if (0 == strcmp(nodes[node].name, name))
+	TAILQ_FOREACH(nc, &n->childq, child)
+		if (nc->node == NODE_TITLE)
 			break;
 
-	/* FIXME: do more with these error messages... */
-	if (NODE__MAX == node && NODE_ROOT == ps->node) {
-		fprintf(stderr, "%s: ignoring node\n", name);
-		return;
-	} else if (NODE__MAX == node) {
-		fprintf(stderr, "%s: unknown node\n", name);
-		ps->stop = 1;
-		return;
-	} else if (NODE_ROOT == ps->node && NULL != ps->root) {
-		fprintf(stderr, "%s: reentering?\n", name);
-		ps->stop = 1;
-		return;
-	} else if (NODE_ROOT == ps->node && NODE_REFENTRY != node) {
-		fprintf(stderr, "%s: known node w/o context\n", name);
-		return;
-	} else if ( ! isparent(node, ps->node)) {
-		fprintf(stderr, "%s: bad parent\n", name);
-		ps->stop = 1;
-		return;
+	if (nc == NULL) {
+		switch (n->node) {
+		case NODE_PREFACE:
+			title = "Preface";
+			break;
+		case NODE_APPENDIX:
+			title = "Appendix";
+			break;
+		case NODE_LEGALNOTICE:
+			title = "Legal Notice";
+			break;
+		case NODE_CAUTION:
+			title = "Caution";
+			break;
+		case NODE_NOTE:
+			title = "Note";
+			break;
+		case NODE_TIP:
+			title = "Tip";
+			break;
+		case NODE_WARNING:
+			title = "Warning";
+			break;
+		default:
+			title = "Unknown";
+			break;
+		}
 	}
 
-	if (NULL == (dat = calloc(1, sizeof(struct pnode)))) {
-		perror(NULL);
-		exit(EXIT_FAILURE);
+	switch (level) {
+	case 1:
+		macro_close(f);
+		macro_open(f, "Sh");
+		break;
+	case 2:
+		macro_close(f);
+		macro_open(f, "Ss");
+		break;
+	default:
+		pnode_printpara(f, n);
+		macro_open(f, "Sy");
+		break;
 	}
 
-	dat->node = ps->node = node;
-	dat->parent = ps->cur;
-	TAILQ_INIT(&dat->childq);
-
-	if (NULL != ps->cur)
-		TAILQ_INSERT_TAIL(&ps->cur->childq, dat, child);
-
-	ps->cur = dat;
-	if (NULL == ps->root)
-		ps->root = dat;
+	if (nc != NULL) {
+		macro_addnode(f, nc, flags);
+		pnode_unlink(nc);
+	} else
+		macro_addarg(f, title, flags | ARG_QUOTED);
+	macro_close(f);
 }
 
 /*
- * Roll up the parse tree.
- * If we're at a text node, roll that one up first.
- * If we hit the root, then assign ourselves as the NODE_ROOT.
+ * Start a reference, extracting the title and volume.
  */
 static void
-xml_elem_end(void *arg, const XML_Char *name)
+pnode_printciterefentry(struct format *f, struct pnode *n)
 {
-	struct parse	*ps = arg;
+	struct pnode	*nc, *title, *manvol;
 
-	if (ps->stop || NODE_ROOT == ps->node)
-		return;
-
-	/* Close out text node, if applicable... */
-	if (NODE_TEXT == ps->node) {
-		assert(NULL != ps->cur);
-		pnode_trim(ps->cur);
-		ps->cur = ps->cur->parent;
-		assert(NULL != ps->cur);
-		ps->node = ps->cur->node;
+	title = manvol = NULL;
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		if (nc->node == NODE_MANVOLNUM)
+			manvol = nc;
+		else if (nc->node == NODE_REFENTRYTITLE)
+			title = nc;
 	}
-
-	if (NULL == (ps->cur = ps->cur->parent))
-		ps->node = NODE_ROOT;
+	macro_open(f, "Xr");
+	if (title == NULL)
+		macro_addarg(f, "unknown", ARG_SPACE);
 	else
-		ps->node = ps->cur->node;
+		macro_addnode(f, title, ARG_SPACE | ARG_SINGLE);
+	if (manvol == NULL)
+		macro_addarg(f, "1", ARG_SPACE);
+	else
+		macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE);
+	pnode_unlinksub(n);
 }
 
-/*
- * Recursively free a node (NULL is ok).
- */
 static void
-pnode_free(struct pnode *pn)
+pnode_printrefmeta(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
+	struct pnode	*nc, *title, *manvol;
 
-	if (NULL == pn)
-		return;
-
-	while (NULL != (pp = TAILQ_FIRST(&pn->childq))) {
-		TAILQ_REMOVE(&pn->childq, pp, child);
-		pnode_free(pp);
+	title = manvol = NULL;
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		if (nc->node == NODE_MANVOLNUM)
+			manvol = nc;
+		else if (nc->node == NODE_REFENTRYTITLE)
+			title = nc;
 	}
-
-	free(pn->b);
-	free(pn);
+	macro_close(f);
+	macro_open(f, "Dt");
+	if (title == NULL)
+		macro_addarg(f, "UNKNOWN", ARG_SPACE);
+	else
+		macro_addnode(f, title, ARG_SPACE | ARG_SINGLE | ARG_UPPER);
+	if (manvol == NULL)
+		macro_addarg(f, "1", ARG_SPACE);
+	else
+		macro_addnode(f, manvol, ARG_SPACE | ARG_SINGLE);
+	macro_close(f);
+	pnode_unlink(n);
 }
 
-/*
- * Unlink a node from its parent and pnode_free() it.
- */
 static void
-pnode_unlink(struct pnode *pn)
+pnode_printfuncdef(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc;
 
-	if (NULL != pn->parent)
-		TAILQ_REMOVE(&pn->parent->childq, pn, child);
-	pnode_free(pn);
+	nc = TAILQ_FIRST(&n->childq);
+	if (nc != NULL && nc->node == NODE_TEXT) {
+		macro_argline(f, "Ft", nc->b);
+		pnode_unlink(nc);
+	}
+	macro_nodeline(f, "Fo", n, ARG_SINGLE);
+	pnode_unlinksub(n);
 }
 
 /*
- * Unlink all children of a node and pnode_free() them.
+ * The <mml:mfenced> node is a little peculiar.
+ * First, it can have arbitrary open and closing tokens, which default
+ * to parentheses.
+ * Second, >1 arguments are separated by commas.
  */
 static void
-pnode_unlinksub(struct pnode *pn)
+pnode_printmathfenced(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc;
 
-	while ( ! TAILQ_EMPTY(&pn->childq))
-		pnode_unlink(TAILQ_FIRST(&pn->childq));
-}
+	printf("left %s ", pnode_getattr_raw(n, ATTRKEY_OPEN, "("));
 
-/*
- * Reset the lookaside buffer.
- */
-static void
-bufclear(struct parse *p)
-{
+	nc = TAILQ_FIRST(&n->childq);
+	pnode_print(f, nc);
 
-	p->b[p->bsz = 0] = '\0';
+	while ((nc = TAILQ_NEXT(nc, child)) != NULL) {
+		putchar(',');
+		pnode_print(f, nc);
+	}
+	printf("right %s ", pnode_getattr_raw(n, ATTRKEY_CLOSE, ")"));
+	pnode_unlinksub(n);
 }
 
 /*
- * Append NODE_TEXT contents to the current buffer, reallocating its
- * size if necessary.
- * The buffer is ALWAYS nil-terminated.
+ * These math nodes require special handling because they have infix
+ * syntax, instead of the usual prefix or prefix.
+ * So we need to break up the first and second child node with a
+ * particular eqn(7) word.
  */
 static void
-bufappend(struct parse *p, struct pnode *pn)
+pnode_printmath(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc;
 
-	assert(NODE_TEXT == pn->node);
-	if (p->bsz + pn->bsz + 1 > p->mbsz) {
-		p->mbsz = p->bsz + pn->bsz + 1;
-		if (NULL == (p->b = realloc(p->b, p->mbsz))) {
-			perror(NULL);
-			exit(EXIT_FAILURE);
-		}
+	nc = TAILQ_FIRST(&n->childq);
+	pnode_print(f, nc);
+
+	switch (n->node) {
+	case NODE_MML_MSUP:
+		fputs(" sup ", stdout);
+		break;
+	case NODE_MML_MFRAC:
+		fputs(" over ", stdout);
+		break;
+	case NODE_MML_MSUB:
+		fputs(" sub ", stdout);
+		break;
+	default:
+		break;
 	}
-	memcpy(p->b + p->bsz, pn->b, pn->bsz);
-	p->bsz += pn->bsz;
-	p->b[p->bsz] = '\0';
+
+	nc = TAILQ_NEXT(nc, child);
+	pnode_print(f, nc);
+	pnode_unlinksub(n);
 }
 
-/*
- * Recursively append all NODE_TEXT nodes to the buffer.
- * This descends into non-text nodes, but doesn't do anything beyond
- * them.
- * In other words, this is a recursive text grok.
- */
 static void
-bufappend_r(struct parse *p, struct pnode *pn)
+pnode_printfuncprototype(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
+	struct pnode	*nc, *fdef;
 
-	if (NODE_TEXT == pn->node)
-		bufappend(p, pn);
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		bufappend_r(p, pp);
+	TAILQ_FOREACH(fdef, &n->childq, child)
+		if (fdef->node == NODE_FUNCDEF)
+			break;
+
+	if (fdef != NULL) {
+		pnode_printfuncdef(f, fdef);
+		pnode_unlink(fdef);
+	} else
+		macro_line(f, "Fo UNKNOWN");
+
+	TAILQ_FOREACH(nc, &n->childq, child)
+		macro_nodeline(f, "Fa", nc, ARG_SINGLE);
+
+	macro_line(f, "Fc");
+	pnode_unlinksub(n);
 }
 
 /*
- * Recursively print text presumably on a macro line.
- * Convert all whitespace to regular spaces.
+ * The <arg> element is more complicated than it should be because text
+ * nodes are treated like ".Ar foo", but non-text nodes need to be
+ * re-sent into the printer (i.e., without the preceding ".Ar").
+ * This also handles the case of "repetition" (or in other words, the
+ * ellipsis following an argument) and optionality.
  */
 static void
-pnode_printmacrolinepart(struct parse *p, struct pnode *pn)
+pnode_printarg(struct format *f, struct pnode *n)
 {
-	char		*cp;
+	struct pnode	*nc;
+	struct pattr	*a;
+	int		 isop, isrep, was_impl;
 
-	bufclear(p);
-	bufappend_r(p, pn);
+	isop = 1;
+	isrep = was_impl = 0;
+	TAILQ_FOREACH(a, &n->attrq, child) {
+		if (a->key == ATTRKEY_CHOICE &&
+		    (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ))
+			isop = 0;
+		else if (a->key == ATTRKEY_REP && a->val == ATTRVAL_REPEAT)
+			isrep = 1;
+	}
+	if (isop) {
+		if (f->flags & FMT_IMPL) {
+			was_impl = 1;
+			macro_open(f, "Oo");
+		} else {
+			macro_open(f, "Op");
+			f->flags |= FMT_IMPL;
+		}
+	}
 
-	/* Convert all space to spaces. */
-	for (cp = p->b; '\0' != *cp; cp++)
-		if (isspace((int)*cp))
-			*cp = ' ';
-
-	for (cp = p->b; isspace((int)*cp); cp++)
-		/* Spin past whitespace (XXX: necessary?) */ ;
-	for ( ; '\0' != *cp; cp++) {
-		/* Escape us if we look like a macro. */
-		if ((cp == p->b || ' ' == *(cp - 1)) &&
-			isupper((int)*cp) &&
-			'\0' != *(cp + 1) && 
-			islower((int)*(cp + 1)) &&
-			('\0' == *(cp + 2) || 
-			 ' ' == *(cp + 2) ||
-			 (islower((int)*(cp + 2)) &&
-			  ('\0' == *(cp + 3) || 
-			   ' ' == *(cp + 3)))))
-			fputs("\\&", stdout);
-		putchar(*cp);
-		/* If we're a character escape, escape us. */
-		if ('\\' == *cp)
-			putchar('e');
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		if (nc->node == NODE_TEXT)
+			macro_open(f, "Ar");
+		pnode_print(f, nc);
+		if (isrep && nc->node == NODE_TEXT)
+			macro_addarg(f, "...", ARG_SPACE);
 	}
+	if (isop) {
+		if (was_impl)
+			macro_open(f, "Oc");
+		else
+			f->flags &= ~FMT_IMPL;
+	}
+	pnode_unlinksub(n);
 }
 
-/*
- * Just pnode_printmacrolinepart() but with a newline.
- * If no text, just the newline.
- */
 static void
-pnode_printmacroline(struct parse *p, struct pnode *pn)
+pnode_printgroup(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc, *nn;
+	struct pattr	*a;
+	int		 isop, sv;
 
-	pnode_printmacrolinepart(p, pn);
-	putchar('\n');
-}
+	isop = 1;
+	TAILQ_FOREACH(a, &n->attrq, child)
+		if (a->key == ATTRKEY_CHOICE &&
+		    (a->val == ATTRVAL_PLAIN || a->val == ATTRVAL_REQ)) {
+			isop = 0;
+			break;
+		}
 
-static void
-pnode_printmopen(struct parse *p)
-{
-	if (p->newln) {
-		putchar('.');
-		p->newln = 0;
-	} else
-		putchar(' ');
+	/*
+	 * Make sure we're on a macro line.
+	 * This will prevent pnode_print() for putting us on a
+	 * subsequent line.
+	 */
+	sv = f->linestate == LINE_NEW;
+	if (isop)
+		macro_open(f, "Op");
+	else if (sv)
+		macro_open(f, "No");
+	f->flags |= FMT_IMPL;
+
+	/*
+	 * Keep on printing text separated by the vertical bar as long
+	 * as we're within the same origin node as the group.
+	 * This is kind of a nightmare.
+	 * Eh, DocBook...
+	 * FIXME: if there's a "Fl", we don't cut off the leading "-"
+	 * like we do in pnode_print().
+	 */
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		pnode_print(f, nc);
+		nn = TAILQ_NEXT(nc, child);
+		while (nn != NULL) {
+			if (nc->node != nn->node)
+				break;
+			macro_addarg(f, "|", ARG_SPACE);
+			macro_addnode(f, nn, ARG_SPACE);
+			nc = nn;
+			nn = TAILQ_NEXT(nn, child);
+		}
+	}
+	if (sv)
+		macro_close(f);
+	f->flags &= ~FMT_IMPL;
+	pnode_unlinksub(n);
 }
 
 static void
-pnode_printmclose(struct parse *p, int sv)
+pnode_printauthor(struct format *f, struct pnode *n)
 {
+	struct pnode	*nc, *nn;
+	int		 have_contrib, have_name;
 
-	if (sv && ! p->newln) {
-		putchar('\n');
-		p->newln = 1;
+	/*
+	 * Print <contrib> children up front, before the .An scope,
+	 * and figure out whether we a name of a person.
+	 */
+
+	have_contrib = have_name = 0;
+	TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
+		switch (nc->node) {
+		case NODE_CONTRIB:
+			if (have_contrib)
+				print_text(f, ",", 0);
+			print_textnode(f, nc);
+			pnode_unlink(nc);
+			have_contrib = 1;
+			break;
+		case NODE_PERSONNAME:
+			have_name = 1;
+			break;
+		default:
+			break;
+		}
 	}
+	if (TAILQ_FIRST(&n->childq) == NULL)
+		return;
+
+	if (have_contrib)
+		print_text(f, ":", 0);
+
+	/*
+         * If we have a name, print it in the .An scope and leave
+         * all other content for child handlers, to print after the
+         * scope.  Otherwise, print everything in the scope.
+	 */
+
+	macro_open(f, "An");
+	TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
+		if (nc->node == NODE_PERSONNAME || have_name == 0) {
+			macro_addnode(f, nc, ARG_SPACE);
+			pnode_unlink(nc);
+		}
+	}
+
+	/*
+	 * If there is an email address,
+	 * print it on the same macro line.
+	 */
+
+	if ((nc = pnode_findfirst(n, NODE_EMAIL)) != NULL) {
+		f->flags |= FMT_CHILD;
+		pnode_print(f, nc);
+		pnode_unlink(nc);
+	}
+
+	/*
+	 * If there are still unprinted children, end the scope
+	 * with a comma.  Otherwise, leave the scope open in case
+	 * a text node follows that starts with closing punctuation.
+	 */
+
+	if (TAILQ_FIRST(&n->childq) != NULL) {
+		macro_addarg(f, ",", ARG_SPACE);
+		macro_close(f);
+	}
 }
 
-/*
- * If the SYNOPSIS macro has a superfluous title, kill it.
- */
 static void
-pnode_printrefsynopsisdiv(struct parse *p, struct pnode *pn)
+pnode_printlink(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
+	struct pnode	*nc;
+	const char	*uri, *text;
 
-	TAILQ_FOREACH(pp, &pn->childq, child) 
-		if (NODE_TITLE == pp->node) {
-			pnode_unlink(pp);
-			return;
+	uri = pnode_getattr_raw(n, ATTRKEY_LINKEND, NULL);
+	if (uri != NULL) {
+		if (TAILQ_FIRST(&n->childq) != NULL) {
+			TAILQ_FOREACH(nc, &n->childq, child)
+				pnode_print(f, nc);
+			text = "";
+		} else if ((text = pnode_getattr_raw(n,
+		    ATTRKEY_ENDTERM, NULL)) != NULL) {
+			if (f->linestate == LINE_MACRO && f->flags & FMT_ARG)
+				macro_addarg(f, text, ARG_SPACE);
+			else
+				print_text(f, text, ARG_SPACE);
 		}
+		if (text != NULL) {
+			if (f->flags & FMT_IMPL)
+				macro_open(f, "Po");
+			else {
+				macro_open(f, "Pq");
+				f->flags |= FMT_CHILD;
+			}
+		}
+		macro_open(f, "Sx");
+		macro_addarg(f, uri, ARG_SPACE);
+		if (text != NULL && f->flags & FMT_IMPL)
+			macro_open(f, "Pc");
+		pnode_unlinksub(n);
+		return;
+	}
+	uri = pnode_getattr_raw(n, ATTRKEY_XLINK_HREF, NULL);
+	if (uri == NULL)
+		uri = pnode_getattr_raw(n, ATTRKEY_URL, NULL);
+	if (uri != NULL) {
+		macro_open(f, "Lk");
+		macro_addarg(f, uri, ARG_SPACE | ARG_SINGLE);
+		if (TAILQ_FIRST(&n->childq) != NULL)
+			macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
+		pnode_unlinksub(n);
+		return;
+	}
 }
 
-/*
- * Start a hopefully-named `Sh' section.
- */
 static void
-pnode_printrefsect(struct parse *p, struct pnode *pn)
+pnode_printprologue(struct format *f, struct ptree *tree)
 {
-	struct pnode	*pp;
+	struct pnode	*refmeta;
 
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		if (NODE_TITLE == pp->node)
-			break;
+	refmeta = tree->root == NULL ? NULL :
+	    pnode_findfirst(tree->root, NODE_REFMETA);
 
-	fputs(".Sh ", stdout);
-
-	if (NULL != pp) {
-		pnode_printmacroline(p, pp);
-		pnode_unlink(pp);
+	macro_line(f, "Dd $Mdocdate" "$");
+	if (refmeta == NULL) {
+		macro_open(f, "Dt");
+		macro_addarg(f,
+		    pnode_getattr_raw(tree->root, ATTRKEY_ID, "UNKNOWN"),
+		    ARG_SPACE | ARG_SINGLE | ARG_UPPER);
+		macro_addarg(f, "1", ARG_SPACE);
+		macro_close(f);
 	} else
-		puts("UNKNOWN");
+		pnode_printrefmeta(f, refmeta);
+	macro_line(f, "Os");
+
+	if (tree->flags & TREE_EQN) {
+		macro_line(f, "EQ");
+		print_text(f, "delim $$", 0);
+		macro_line(f, "EN");
+	}
 }
 
 /*
- * Start a reference, extracting the title and volume.
+ * We can have multiple <term> elements within a <varlistentry>, which
+ * we should comma-separate as list headers.
  */
 static void
-pnode_printciterefentry(struct parse *p, struct pnode *pn)
+pnode_printvarlistentry(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *title, *manvol;
+	struct pnode	*nc, *nn;
+	int		 first = 1;
 
-	title = manvol = NULL;
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		if (NODE_MANVOLNUM == pp->node)
-			manvol = pp;
-		else if (NODE_REFENTRYTITLE == pp->node)
-			title = pp;
-
-	fputs(".Xr ", stdout);
-
-	if (NULL != title) {
-		pnode_printmacrolinepart(p, title);
-		putchar(' ');
-	} else
-		fputs("unknown ", stdout);
-
-	if (NULL != manvol)
-		pnode_printmacroline(p, manvol);
-	else
-		puts("1");
+	macro_open(f, "It");
+	f->flags |= FMT_IMPL;
+	TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
+		if (nc->node != NODE_TERM && nc->node != NODE_GLOSSTERM)
+			continue;
+		if (first == 0) {
+			switch (f->linestate) {
+			case LINE_NEW:
+				break;
+			case LINE_TEXT:
+				print_text(f, ",", 0);
+				break;
+			case LINE_MACRO:
+				macro_addarg(f, ",", 0);
+				break;
+			}
+		}
+		pnode_print(f, nc);
+		pnode_unlink(nc);
+		first = 0;
+	}
+	macro_close(f);
+	while ((nc = TAILQ_FIRST(&n->childq)) != NULL) {
+		pnode_print(f, nc);
+		pnode_unlink(nc);
+	}
+	macro_close(f);
 }
 
 static void
-pnode_printrefmeta(struct parse *p, struct pnode *pn)
+pnode_printtitle(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *title, *manvol;
+	struct pnode	*nc, *nn;
 
-	title = manvol = NULL;
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		if (NODE_MANVOLNUM == pp->node)
-			manvol = pp;
-		else if (NODE_REFENTRYTITLE == pp->node)
-			title = pp;
-
-	puts(".Dd $Mdocdate" "$");
-	fputs(".Dt ", stdout);
-
-	if (NULL != title) {
-		/* FIXME: uppercase. */
-		pnode_printmacrolinepart(p, title);
-		putchar(' ');
-	} else
-		fputs("UNKNOWN ", stdout);
-
-	if (NULL != manvol)
-		pnode_printmacroline(p, manvol);
-	else
-		puts("1");
-
-	puts(".Os");
+	TAILQ_FOREACH_SAFE(nc, &n->childq, child, nn) {
+		if (nc->node == NODE_TITLE) {
+			pnode_printpara(f, nc);
+			pnode_print(f, nc);
+			pnode_unlink(nc);
+		}
+	}
 }
 
 static void
-pnode_printfuncdef(struct parse *p, struct pnode *pn)
+pnode_printrow(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *ftype, *func;
+	struct pnode	*nc;
 
-	ftype = func = NULL;
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		if (NODE_TEXT == pp->node)
-			ftype = pp;
-		else if (NODE_FUNCTION == pp->node)
-			func = pp;
-
-	if (NULL != ftype) {
-		fputs(".Ft ", stdout);
-		pnode_printmacroline(p, ftype);
+	macro_line(f, "Bl -dash -compact");
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		macro_line(f, "It");
+		pnode_print(f, nc);
 	}
-
-	if (NULL != func) {
-		fputs(".Fo ", stdout);
-		pnode_printmacroline(p, func);
-	} else 
-		puts(".Fo UNKNOWN");
+	macro_line(f, "El");
+	pnode_unlink(n);
 }
 
 static void
-pnode_printparamdef(struct parse *p, struct pnode *pn)
+pnode_printtgroup1(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *ptype, *param;
+	struct pnode	*nc;
 
-	ptype = param = NULL;
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		if (NODE_TEXT == pp->node)
-			ptype = pp;
-		else if (NODE_PARAMETER == pp->node)
-			param = pp;
-
-	fputs(".Fa \"", stdout);
-	if (NULL != ptype) {
-		pnode_printmacrolinepart(p, ptype);
-		putchar(' ');
+	macro_line(f, "Bl -bullet -compact");
+	while ((nc = pnode_findfirst(n, NODE_ENTRY)) != NULL) {
+		macro_line(f, "It");
+		pnode_print(f, nc);
+		pnode_unlink(nc);
 	}
-
-	if (NULL != param)
-		pnode_printmacrolinepart(p, param);
-	else
-		fputs("UNKNOWN", stdout);
-
-	puts("\"");
+	macro_line(f, "El");
+	pnode_unlinksub(n);
 }
 
 static void
-pnode_printfuncprototype(struct parse *p, struct pnode *pn)
+pnode_printtgroup2(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *fdef;
+	struct pnode	*nr, *ne;
 
-	TAILQ_FOREACH(fdef, &pn->childq, child)
-		if (NODE_FUNCDEF == fdef->node) 
+	macro_line(f, "Bl -tag -width Ds");
+	while ((nr = pnode_findfirst(n, NODE_ROW)) != NULL) {
+		if ((ne = pnode_findfirst(n, NODE_ENTRY)) == NULL)
 			break;
-
-	if (NULL != fdef)
-		pnode_printfuncdef(p, fdef);
-	else
-		puts(".Fo UNKNOWN");
-
-	TAILQ_FOREACH(pp, &pn->childq, child) 
-		if (NODE_PARAMDEF == pp->node)
-			pnode_printparamdef(p, pp);
-
-	puts(".Fc");
+		macro_open(f, "It");
+		f->flags |= FMT_IMPL;
+		pnode_print(f, ne);
+		macro_close(f);
+		pnode_unlink(ne);
+		pnode_print(f, nr);
+		pnode_unlink(nr);
+	}
+	macro_line(f, "El");
+	pnode_unlinksub(n);
 }
 
-/* 
- * The <arg> element is more complicated than it should be because text
- * nodes are treated like ".Ar foo", but non-text nodes need to be
- * re-sent into the printer (i.e., without the preceding ".Ar").
- * TODO: handle "optional" attribute.
- */
 static void
-pnode_printarg(struct parse *p, struct pnode *pn)
+pnode_printtgroup(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
+	struct pnode	*nc;
 
-	TAILQ_FOREACH(pp, &pn->childq, child) {
-		if (NODE_TEXT == pp->node) {
-			pnode_printmopen(p);
-			fputs("Ar ", stdout);
-		} 
-		pnode_print(p, pp);
+	switch (atoi(pnode_getattr_raw(n, ATTRKEY_COLS, "0"))) {
+	case 1:
+		pnode_printtgroup1(f, n);
+		return;
+	case 2:
+		pnode_printtgroup2(f, n);
+		return;
+	default:
+		break;
 	}
+
+	macro_line(f, "Bl -ohang");
+	while ((nc = pnode_findfirst(n, NODE_ROW)) != NULL) {
+		macro_line(f, "It Table Row");
+		pnode_printrow(f, nc);
+	}
+	macro_line(f, "El");
+	pnode_unlinksub(n);
 }
 
-/* 
- * Recursively search and return the first instance of "node".
- */
-static struct pnode *
-pnode_findfirst(struct pnode *pn, enum nodeid node)
+static void
+pnode_printlist(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp, *res;
+	struct pnode	*nc;
 
-	res = NULL;
-	TAILQ_FOREACH(pp, &pn->childq, child) {
-		res = pp->node == node ? pp :
-			pnode_findfirst(pp, node);
-		if (NULL != res)
-			break;
+	pnode_printtitle(f, n);
+	macro_argline(f, "Bl",
+	    n->node == NODE_ORDEREDLIST ? "-enum" : "-bullet");
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		macro_line(f, "It");
+		pnode_print(f, nc);
 	}
-
-	return(res);
+	macro_line(f, "El");
+	pnode_unlinksub(n);
 }
 
 static void
-pnode_printprologue(struct parse *p, struct pnode *pn)
+pnode_printvariablelist(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
+	struct pnode	*nc;
 
-	pp = NULL == p->root ? NULL :
-		pnode_findfirst(p->root, NODE_REFMETA);
-
-	if (NULL != pp) {
-		pnode_printrefmeta(p, pp);
-		pnode_unlink(pp);
-	} else {
-		puts(".\\\" Supplying bogus prologue...");
-		puts(".Dd $Mdocdate" "$");
-		puts(".Dt UNKNOWN 1");
-		puts(".Os");
+	pnode_printtitle(f, n);
+	macro_line(f, "Bl -tag -width Ds");
+	TAILQ_FOREACH(nc, &n->childq, child) {
+		if (nc->node == NODE_VARLISTENTRY)
+			pnode_printvarlistentry(f, nc);
+		else
+			macro_nodeline(f, "It", nc, 0);
 	}
+	macro_line(f, "El");
+	pnode_unlinksub(n);
 }
 
 /*
  * Print a parsed node (or ignore it--whatever).
  * This is a recursive function.
- * FIXME: macro line continuation?
+ * FIXME: if we're in a literal context (<screen> or <programlisting> or
+ * whatever), don't print inline macros.
  */
 static void
-pnode_print(struct parse *p, struct pnode *pn)
+pnode_print(struct format *f, struct pnode *n)
 {
-	struct pnode	*pp;
-	char		*cp;
-	int		 last, sv;
+	struct pnode	*nc, *nn;
+	enum linestate	 sv;
 
-	if (NULL == pn)
+	if (n == NULL)
 		return;
 
-	sv = p->newln;
+	sv = f->linestate;
+	if (n->spc)
+		f->flags &= ~FMT_NOSPC;
+	else
+		f->flags |= FMT_NOSPC;
 
-	switch (pn->node) {
-	case (NODE_ARG):
-		pnode_printarg(p, pn);
-		pnode_unlinksub(pn);
+	switch (n->node) {
+	case NODE_APPLICATION:
+		macro_open(f, "Nm");
 		break;
-	case (NODE_CITEREFENTRY):
-		assert(p->newln);
-		pnode_printciterefentry(p, pn);
-		pnode_unlinksub(pn);
+	case NODE_ARG:
+		pnode_printarg(f, n);
 		break;
-	case (NODE_CODE):
-		pnode_printmopen(p);
-		fputs("Li ", stdout);
+	case NODE_AUTHOR:
+		pnode_printauthor(f, n);
 		break;
-	case (NODE_COMMAND):
-		pnode_printmopen(p);
-		fputs("Nm ", stdout);
+	case NODE_AUTHORGROUP:
+		macro_line(f, "An -split");
 		break;
-	case (NODE_FUNCTION):
-		pnode_printmopen(p);
-		fputs("Fn ", stdout);
+	case NODE_BLOCKQUOTE:
+		macro_line(f, "Bd -ragged -offset indent");
 		break;
-	case (NODE_FUNCPROTOTYPE):
-		assert(p->newln);
-		pnode_printfuncprototype(p, pn);
-		pnode_unlinksub(pn);
+	case NODE_BOOKINFO:
+		macro_line(f, "Sh NAME");
 		break;
-	case (NODE_FUNCSYNOPSISINFO):
-		pnode_printmopen(p);
-		fputs("Fd ", stdout);
+	case NODE_CITEREFENTRY:
+		pnode_printciterefentry(f, n);
 		break;
-	case (NODE_OPTION):
-		pnode_printmopen(p);
-		fputs("Fl ", stdout);
+	case NODE_CITETITLE:
+		macro_open(f, "%T");
 		break;
-	case (NODE_PARA):
-		assert(p->newln);
-		puts(".Pp");
+	case NODE_COMMAND:
+		macro_open(f, "Nm");
 		break;
-	case (NODE_PARAMETER):
-		/* Suppress non-text children... */
-		pnode_printmopen(p);
-		fputs("Fa \"", stdout);
-		pnode_printmacrolinepart(p, pn);
-		puts("\"");
-		pnode_unlinksub(pn);
+	case NODE_CONSTANT:
+		macro_open(f, "Dv");
 		break;
-	case (NODE_PROGRAMLISTING):
-		assert(p->newln);
-		puts(".Bd -literal");
+	case NODE_EDITOR:
+		print_text(f, "editor:", ARG_SPACE);
+		sv = LINE_TEXT;
+		macro_open(f, "An");
 		break;
-	case (NODE_REFMETA):
-		abort();
+	case NODE_EMAIL:
+		macro_open(f, "Aq Mt");
 		break;
-	case (NODE_REFNAME):
+	case NODE_EMPHASIS:
+	case NODE_FIRSTTERM:
+	case NODE_GLOSSTERM:
+		macro_open(f, "Em");
+		break;
+	case NODE_ENVAR:
+		macro_open(f, "Ev");
+		break;
+	case NODE_ERRORNAME:
+		macro_open(f, "Er");
+		break;
+	case NODE_FILENAME:
+		macro_open(f, "Pa");
+		break;
+	case NODE_FUNCTION:
+		macro_open(f, "Fn");
+		break;
+	case NODE_FUNCPROTOTYPE:
+		pnode_printfuncprototype(f, n);
+		break;
+	case NODE_FUNCSYNOPSISINFO:
+		macro_open(f, "Fd");
+		break;
+	case NODE_INFORMALEQUATION:
+		macro_line(f, "EQ");
+		break;
+	case NODE_INLINEEQUATION:
+		if (f->linestate == LINE_NEW)
+			f->linestate = LINE_TEXT;
+		putchar('$');
+		break;
+	case NODE_ITEMIZEDLIST:
+		pnode_printlist(f, n);
+		break;
+	case NODE_GROUP:
+		pnode_printgroup(f, n);
+		break;
+	case NODE_KEYSYM:
+		macro_open(f, "Sy");
+		break;
+	case NODE_LINK:
+		pnode_printlink(f, n);
+		break;
+	case NODE_LITERAL:
+		macro_open(f, "Ql");
+		break;
+	case NODE_LITERALLAYOUT:
+		macro_close(f);
+		macro_argline(f, "Bd", pnode_getattr(n, ATTRKEY_CLASS) ==
+		    ATTRVAL_MONOSPACED ? "-literal" : "-unfilled");
+		break;
+	case NODE_MARKUP:
+		macro_open(f, "Ic");
+		break;
+	case NODE_MML_MFENCED:
+		pnode_printmathfenced(f, n);
+		break;
+	case NODE_MML_MROW:
+	case NODE_MML_MI:
+	case NODE_MML_MN:
+	case NODE_MML_MO:
+		if (TAILQ_EMPTY(&n->childq))
+			break;
+		fputs(" { ", stdout);
+		break;
+	case NODE_MML_MFRAC:
+	case NODE_MML_MSUB:
+	case NODE_MML_MSUP:
+		pnode_printmath(f, n);
+		break;
+	case NODE_OPTION:
+		macro_open(f, "Fl");
+		break;
+	case NODE_ORDEREDLIST:
+		pnode_printlist(f, n);
+		break;
+	case NODE_PARA:
+		pnode_printpara(f, n);
+		break;
+	case NODE_PARAMDEF:
+	case NODE_PARAMETER:
+		/* More often, these appear inside NODE_FUNCPROTOTYPE. */
+		macro_open(f, "Fa");
+		macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
+		pnode_unlinksub(n);
+		break;
+	case NODE_QUOTE:
+		macro_open(f, "Qo");
+		break;
+	case NODE_PROGRAMLISTING:
+	case NODE_SCREEN:
+	case NODE_SYNOPSIS:
+		macro_line(f, "Bd -literal");
+		break;
+	case NODE_REFENTRYINFO:
+		/* Suppress. */
+		pnode_unlinksub(n);
+		break;
+	case NODE_REFNAME:
 		/* Suppress non-text children... */
-		pnode_printmopen(p);
-		fputs("Nm ", stdout);
-		pnode_printmacrolinepart(p, pn);
-		pnode_unlinksub(pn);
+		macro_open(f, "Nm");
+		macro_addnode(f, n, ARG_SPACE | ARG_SINGLE);
+		pnode_unlinksub(n);
 		break;
-	case (NODE_REFNAMEDIV):
-		assert(p->newln);
-		puts(".Sh NAME");
+	case NODE_REFNAMEDIV:
+		macro_line(f, "Sh NAME");
 		break;
-	case (NODE_REFPURPOSE):
-		assert(p->newln);
-		fputs(".Nd ", stdout);
+	case NODE_REFPURPOSE:
+		macro_open(f, "Nd");
 		break;
-	case (NODE_REFSYNOPSISDIV):
-		assert(p->newln);
-		pnode_printrefsynopsisdiv(p, pn);
-		puts(".Sh SYNOPSIS");
+	case NODE_REFSYNOPSISDIV:
+		pnode_printrefsynopsisdiv(f, n);
 		break;
-	case (NODE_REFSECT1):
-		assert(p->newln);
-		pnode_printrefsect(p, pn);
+	case NODE_PREFACE:
+	case NODE_SECTION:
+	case NODE_APPENDIX:
+	case NODE_LEGALNOTICE:
+	case NODE_NOTE:
+	case NODE_TIP:
+	case NODE_CAUTION:
+	case NODE_WARNING:
+		pnode_printrefsect(f, n);
 		break;
-	case (NODE_STRUCTNAME):
-		pnode_printmopen(p);
-		fputs("Vt ", stdout);
+	case NODE_REPLACEABLE:
+		macro_open(f, "Ar");
 		break;
-	case (NODE_TEXT):
-		bufclear(p);
-		bufappend(p, pn);
-		/*
-		 * Output all characters, squeezing out whitespace
-		 * between newlines. 
-		 * XXX: all whitespace, including tabs (?).
-		 * Remember to escape control characters and escapes.
-		 */
-		assert(p->bsz);
-		for (last = '\n', cp = p->b; '\0' != *cp; ) {
-			if ('\n' == last) {
-				/* Consume all whitespace. */
-				if (isspace((int)*cp)) {
-					while (isspace((int)*cp))
-						cp++;
-					continue;
-				} else if ('\'' == *cp || '.' == *cp)
-					fputs("\\&", stdout);
-			}
-			putchar(last = *cp++);
-			/* If we're a character escape, escape us. */
-			if ('\\' == last)
-				putchar('e');
+	case NODE_SBR:
+		macro_line(f, "br");
+		break;
+	case NODE_TEXT:
+	case NODE_ESCAPE:
+		pnode_printtext(f, n);
+		break;
+	case NODE_TGROUP:
+		pnode_printtgroup(f, n);
+		break;
+	case NODE_TITLE:
+		if (n->parent != NULL &&
+		    n->parent->node == NODE_BOOKINFO) {
+			macro_open(f, "Nd");
+			break;
 		}
-		p->newln = 0;
+		pnode_printpara(f, n);
+		macro_nodeline(f, "Sy", n, 0);
+		pnode_unlinksub(n);
 		break;
+	case NODE_TYPE:
+		macro_open(f, "Vt");
+		break;
+	case NODE_VARIABLELIST:
+		pnode_printvariablelist(f, n);
+		break;
+	case NODE_VARNAME:
+		macro_open(f, "Va");
+		break;
 	default:
 		break;
 	}
 
-	TAILQ_FOREACH(pp, &pn->childq, child)
-		pnode_print(p, pp);
+	TAILQ_FOREACH(nc, &n->childq, child)
+		pnode_print(f, nc);
 
-	switch (pn->node) {
-	case (NODE_ARG):
-	case (NODE_CODE):
-	case (NODE_COMMAND):
-	case (NODE_FUNCTION):
-	case (NODE_FUNCSYNOPSISINFO):
-	case (NODE_OPTION):
-	case (NODE_PARAMETER):
-	case (NODE_REFNAME):
-	case (NODE_STRUCTNAME):
-	case (NODE_TEXT):
-		pnode_printmclose(p, sv);
+	switch (n->node) {
+	case NODE_ESCAPE:
+	case NODE_TERM:
+	case NODE_TEXT:
+		/* Accept more arguments to the previous macro. */
+		return;
+	case NODE_INFORMALEQUATION:
+		macro_line(f, "EN");
 		break;
-	case (NODE_PROGRAMLISTING):
-		assert(p->newln);
-		puts(".Ed");
-		p->newln = 1;
+	case NODE_INLINEEQUATION:
+		fputs("$ ", stdout);
+		f->linestate = sv;
 		break;
+	case NODE_MEMBER:
+		if ((nn = TAILQ_NEXT(n, child)) != NULL &&
+		    nn->node != NODE_MEMBER)
+			nn = NULL;
+		switch (f->linestate) {
+		case LINE_TEXT:
+			if (nn != NULL)
+				print_text(f, ",", 0);
+			break;
+		case LINE_MACRO:
+			if (nn != NULL)
+				macro_addarg(f, ",", ARG_SPACE);
+			macro_close(f);
+			break;
+		case LINE_NEW:
+			break;
+		}
+		break;
+	case NODE_MML_MROW:
+	case NODE_MML_MI:
+	case NODE_MML_MN:
+	case NODE_MML_MO:
+		if (TAILQ_EMPTY(&n->childq))
+			break;
+		fputs(" } ", stdout);
+		break;
+	case NODE_QUOTE:
+		if (sv == LINE_NEW)
+			macro_close(f);
+		sv = f->linestate;
+		macro_open(f, "Qc");
+		if (sv == LINE_NEW)
+			macro_close(f);
+		break;
+	case NODE_REFNAME:
+		/*
+		 * If we're in the NAME macro and we have multiple
+		 * <refname> macros in sequence, then print out a
+		 * trailing comma before the newline.
+		 */
+		if (n->parent != NULL &&
+		    n->parent->node == NODE_REFNAMEDIV &&
+		    TAILQ_NEXT(n, child) != NULL &&
+		    TAILQ_NEXT(n, child)->node == NODE_REFNAME)
+			macro_addarg(f, ",", ARG_SPACE);
+		if (sv == LINE_NEW)
+			macro_close(f);
+		break;
+	case NODE_PREFACE:
+	case NODE_SECTION:
+	case NODE_APPENDIX:
+	case NODE_LEGALNOTICE:
+	case NODE_NOTE:
+	case NODE_TIP:
+	case NODE_CAUTION:
+	case NODE_WARNING:
+		f->level--;
+		break;
+	case NODE_BLOCKQUOTE:
+	case NODE_LITERALLAYOUT:
+	case NODE_PROGRAMLISTING:
+	case NODE_SCREEN:
+	case NODE_SYNOPSIS:
+		macro_line(f, "Ed");
+		break;
+	case NODE_TITLE:
+		if (n->parent != NULL &&
+		    n->parent->node == NODE_BOOKINFO)
+			macro_line(f, "Sh AUTHORS");
+		break;
 	default:
 		break;
 	}
+	f->flags &= ~FMT_ARG;
 }
 
-/*
- * Loop around the read buffer until we've drained it of all data.
- * Invoke the parser context with each buffer fill.
- */
-static int
-readfile(XML_Parser xp, int fd, 
-	char *b, size_t bsz, const char *fn)
+void
+ptree_print(struct ptree *tree)
 {
-	struct parse	 p;
-	int		 rc;
-	ssize_t		 ssz;
+	struct format	 formatter;
 
-	memset(&p, 0, sizeof(struct parse));
-
-	p.b = malloc(p.bsz = p.mbsz = 1024);
-
-	XML_SetCharacterDataHandler(xp, xml_char);
-	XML_SetElementHandler(xp, xml_elem_start, xml_elem_end);
-	XML_SetUserData(xp, &p);
-
-	while ((ssz = read(fd, b, bsz)) >= 0) {
-		if (0 == (rc = XML_Parse(xp, b, ssz, 0 == ssz)))
-			fprintf(stderr, "%s: %s\n", fn,
-				XML_ErrorString
-				(XML_GetErrorCode(xp)));
-		else if ( ! p.stop && ssz > 0)
-			continue;
-		/* 
-		 * Exit when we've read all or errors have occured
-		 * during the parse sequence.
-		 */
-		p.newln = 1;
-		pnode_printprologue(&p, p.root);
-		pnode_print(&p, p.root);
-		pnode_free(p.root);
-		free(p.b);
-		return(0 != rc && ! p.stop);
-	}
-
-	/* Read error has occured. */
-	perror(fn);
-	pnode_free(p.root);
-	free(p.b);
-	return(0);
-}
-
-int
-main(int argc, char *argv[])
-{
-	XML_Parser	 xp;
-	const char	*fname;
-	char		*buf;
-	int		 fd, rc;
-
-	fname = "-";
-	xp = NULL;
-	buf = NULL;
-	rc = 0;
-
-	if (-1 != getopt(argc, argv, ""))
-		return(EXIT_FAILURE);
-
-	argc -= optind;
-	argv += optind;
-
-	if (argc > 1)
-		return(EXIT_FAILURE);
-	else if (argc > 0)
-		fname = argv[0];
-
-	/* Read from stdin or a file. */
-	fd = 0 == strcmp(fname, "-") ? 
-		STDIN_FILENO : open(fname, O_RDONLY, 0);
-
-	/*
-	 * Open file for reading.
-	 * Allocate a read buffer.
-	 * Create the parser context.
-	 * Dive directly into the parse.
-	 */
-	if (-1 == fd)
-		perror(fname);
-	else if (NULL == (buf = malloc(4096)))
-		perror(NULL);
-	else if (NULL == (xp = XML_ParserCreate(NULL)))
-		perror(NULL);
-	else if ( ! readfile(xp, fd, buf, 4096, fname))
-		rc = 1;
-
-	XML_ParserFree(xp);
-	free(buf);
-	if (STDIN_FILENO != fd)
-		close(fd);
-	return(rc ? EXIT_SUCCESS : EXIT_FAILURE);
+	formatter.level = 0;
+	formatter.linestate = LINE_NEW;
+	pnode_printprologue(&formatter, tree);
+	pnode_print(&formatter, tree->root);
+	if (formatter.linestate != LINE_NEW)
+		putchar('\n');
 }