multimarkdown 4.5.0.r1

data/MultiMarkdown-4/parser.h

@@ -0,0 +1,186 @@
+/* ensure we only load this once */
+
+#ifndef PARSER_LIB_H
+#define PARSER_LIB_H
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <assert.h>
+#include <time.h>
+#include "glib.h"
+#include "libMultiMarkdown.h"
+
+#define TABSTOP 4
+
+#define MMD_VERSION "4.5"
+
+#define MMD_COPYRIGHT \
+	"Copyright (c) 2013 Fletcher T. Penney.\n\n" \
+	"portions based on peg-markdown - Copyright (c) 2008-2009 John MacFarlane.\n" \
+	"peg-markdown is Licensed under either the GPLv2+ or MIT.\n" \
+	"portions Copyright (c) 2011 Daniel Jalkut, MIT licensed.\n\n" \
+	"This is free software: you are free to change and redistribute it.\n" \
+	"There is NO WARRANTY, to the extent permitted by law.\n\n"
+
+
+#define DEBUG_OFF		/* Turn on debugging statements (there's a bunch!)*/
+
+
+/* This is the type used for the $$ pseudovariable passed to parents */
+#define YYSTYPE node *
+
+/* Define a structure to simplify handling of links */
+struct link_data {
+	char *label;                /* if this is a reference link */
+	char *source;               /* source URL     */
+	char *title;                /* title string   */
+	node *attr;                 /* attribute tree */
+};
+
+typedef struct link_data link_data;
+
+/* This is the data we store in the parser context */
+typedef struct {
+	char *charbuf;              /* Input buffer */
+	char *original;             /* Original input buffer */
+	node *result;               /* Resulting parse tree */
+	unsigned long extensions;   /* Extension bitfield */
+	node *autolabels;           /* Store for later retrieval */
+	bool  parse_aborted;        /* We got bogged down - fail parse */
+	clock_t stop_time;          /* Note the deadline to complete parsing */
+} parser_data;
+
+/* A "scratch pad" for storing data when writing output 
+	The structure will vary based on what you need */
+typedef struct {
+	unsigned long extensions;    /* Store copy of extensions for retrieval */
+	int   padded;                /* Track newlines */
+	int   baseheaderlevel;       /* Increase header levels when outputting */
+	int   language;              /* For smart quotes */
+	char *table_alignment;       /* Hold the alignment string while parsing table */
+	int   table_column;          /* Track the current column number */
+	char  cell_type;             /* What sort of cell type are we in? */
+	bool  printing_notes;        /* Are we printing notes/glossary/etc.? */
+	node *notes;                 /* Store reference notes */
+	node *links;                 /* ... links */
+	node *glossary;              /* ... glossary */
+	node *citations;             /* ... citations */
+	node *used_notes;            /* notes that have been referenced */
+	node *result_tree;           /* reference to entire result tree */
+	int   footnote_to_print;     /* set while we are printing so we can reverse link */
+	int   footnote_para_counter; /* so we know which para is last */
+	int   max_footnote_num;      /* so we know if current note is new or repeat */
+	bool  obfuscate;             /* flag that we need to mask email addresses */
+	char *latex_footer;          /* store for appending at the end */
+	bool  no_latex_footnote;     /* can't use footnotes in some places */
+	int   odf_para_type;         /* what type of paragraph do we need? */
+	bool  odf_list_needs_end_p;  /* is there a <p> that need to be closed */
+	int   random_seed_base;      /* Allow random footnotes */
+	int   table_row;             /* CRC - Track the current row number */
+	int   lyx_para_type;         /* CRC - the type of paragraph being processed */
+	int   lyx_level;             /* CRC - nesting level */
+	bool  no_lyx_footnote;       /* CRC - Can't use footnotes in some places */
+	bool  lyx_number_headers;    /* CRC - Whether to number headers (with or without *) */
+	bool  lyx_definition_hit;    /* CRC  - True when a definition has been encountered */
+	bool  lyx_definition_open;   /* CRC - Have not completed a definition list entry */
+	bool  lyx_in_header;         /* CRC - In a table header */
+	bool  lyx_fragile;           /* CRC - in a beamer fragile frame */
+	bool  lyx_beamerbullet;      /* CRC - beamer bullet list (add <+->) */
+	int   lyx_debug_nest;        /* CRC - nesting level for enhanced debugging */
+	bool  lyx_table_need_line;   /* CRC - need a line at the top */
+	int   lyx_table_total_rows;  /* CRC - The total number of rows in the table */
+	int   lyx_table_total_cols;  /* CRC - The total number of columns in the table */
+	node *lyx_table_caption;     /* CRC - Hold the table caption */
+	GString *lyx_debug_pad;      /* CRC - padding to indent debugging informaiton */
+} scratch_pad;
+
+/* Define smart typography languages -- first in list is default */
+enum language {
+	ENGLISH,
+	DUTCH,
+	FRENCH,
+	GERMAN,
+	GERMANGUILL,
+	SWEDISH,
+};
+
+/* Character types for smart typography */
+enum smartelements {
+	LSQUOTE,
+	RSQUOTE,
+	LDQUOTE,
+	RDQUOTE,
+	NDASH,
+	MDASH,
+	ELLIP,
+	APOS,
+};
+
+
+
+/* parser utilities declarations */
+node * mk_node(int key);
+node * mk_str(char *string);
+node * mk_list(int key, node *list);
+node * mk_link(node *text, char *label, char *source, char *title, node *attr);
+node * mk_pos_node(int key, char *string, unsigned int start, unsigned int stop);
+node * mk_pos_str(char *string, unsigned int start, unsigned int stop);
+node * mk_pos_list(int key, node *list, unsigned int start, unsigned int stop);
+
+void   free_node(node *n);
+void   free_node_tree(node * n);
+void   print_node_tree(node * n);
+node * copy_node(node *n);
+node * copy_node_tree(node *n);
+
+node * cons(node *new, node *list);
+node * reverse_list(node *list);
+void   append_list(node *new, node *list);
+
+node    * mk_str_from_list(node *list, bool extra_newline);
+GString * concat_string_list(node *list);
+
+parser_data * mk_parser_data(char *charbuf, unsigned long extensions);
+void   free_parser_data(parser_data *data);
+
+char * preformat_text(char *text);
+
+scratch_pad * mk_scratch_pad(unsigned long extensions);
+void   free_scratch_pad(scratch_pad *scratch);
+
+link_data * mk_link_data(char *label, char *source, char *title, node *attr);
+void   free_link_data(link_data *l);
+link_data * extract_link_data(char *label, scratch_pad *scratch);
+node * mk_autolink(char *text);
+
+void   extract_references(node *list, scratch_pad *scratch);
+
+bool   extension(int ext, unsigned long extensions);
+
+/* export utilities */
+void   trim_trailing_whitespace(char *str);
+void   trim_trailing_newlines(char *str);
+
+/* other utilities */
+char * label_from_string(char *str);
+char * clean_string(char *str);
+char * label_from_node_tree(node *n);
+char * label_from_node(node *n);
+void   print_raw_node(GString *out, node *n);
+void   print_raw_node_tree(GString *out, node*n);
+
+char * correct_dimension_units(char *original);
+char * metadata_keys(node *list);
+node * metadata_for_key(char *key, node *list);
+char * metavalue_for_key(char *key, node *list);
+
+bool tree_contains_key(node *list, int key);
+int tree_contains_key_count(node *list, int key);
+
+bool check_timeout();
+
+void debug_node(node *n);
+
+#endif

data/MultiMarkdown-4/rng.c

@@ -0,0 +1,117 @@
+/*    This program by D E Knuth is in the public domain and freely copyable
+ *    AS LONG AS YOU MAKE ABSOLUTELY NO CHANGES!
+ *    It is explained in Seminumerical Algorithms, 3rd edition, Section 3.6
+ *    (or in the errata to the 2nd edition --- see
+ *        http://www-cs-faculty.stanford.edu/~knuth/taocp.html
+ *    in the changes to Volume 2 on pages 171 and following).              */
+
+/*    N.B. The MODIFICATIONS introduced in the 9th printing (2002) are
+      included here; there's no backwards compatibility with the original. */
+
+/*    This version also adopts Brendan McKay's suggestion to
+      accommodate naive users who forget to call ran_start(seed).          */
+
+/*    If you find any bugs, please report them immediately to
+ *                 taocp@cs.stanford.edu
+ *    (and you will be rewarded if the bug is genuine). Thanks!            */
+
+/************ see the book for explanations and caveats! *******************/
+/************ in particular, you need two's complement arithmetic **********/
+
+#define KK 100                     /* the long lag */
+#define LL  37                     /* the short lag */
+#define MM (1L<<30)                 /* the modulus */
+#define mod_diff(x,y) (((x)-(y))&(MM-1)) /* subtraction mod MM */
+
+long ran_x[KK];                    /* the generator state */
+
+#ifdef __STDC__
+void ran_array(long aa[],int n)
+#else
+void ran_array(aa,n)    /* put n new random numbers in aa */
+  long *aa;   /* destination */
+  int n;      /* array length (must be at least KK) */
+#endif
+{
+  register int i,j;
+  for (j=0;j<KK;j++) aa[j]=ran_x[j];
+  for (;j<n;j++) aa[j]=mod_diff(aa[j-KK],aa[j-LL]);
+  for (i=0;i<LL;i++,j++) ran_x[i]=mod_diff(aa[j-KK],aa[j-LL]);
+  for (;i<KK;i++,j++) ran_x[i]=mod_diff(aa[j-KK],ran_x[i-LL]);
+}
+
+/* the following routines are from exercise 3.6--15 */
+/* after calling ran_start, get new randoms by, e.g., "x=ran_arr_next()" */
+
+#define QUALITY 1009 /* recommended quality level for high-res use */
+long ran_arr_buf[QUALITY];
+long ran_arr_dummy=-1, ran_arr_started=-1;
+long *ran_arr_ptr=&ran_arr_dummy; /* the next random number, or -1 */
+
+#define TT  70   /* guaranteed separation between streams */
+#define is_odd(x)  ((x)&1)          /* units bit of x */
+
+#ifdef __STDC__
+void ran_start(long seed)
+#else
+void ran_start(seed)    /* do this before using ran_array */
+  long seed;            /* selector for different streams */
+#endif
+{
+  register int t,j;
+  long x[KK+KK-1];              /* the preparation buffer */
+  register long ss=(seed+2)&(MM-2);
+  for (j=0;j<KK;j++) {
+    x[j]=ss;                      /* bootstrap the buffer */
+    ss<<=1; if (ss>=MM) ss-=MM-2; /* cyclic shift 29 bits */
+  }
+  x[1]++;              /* make x[1] (and only x[1]) odd */
+  for (ss=seed&(MM-1),t=TT-1; t; ) {       
+    for (j=KK-1;j>0;j--) x[j+j]=x[j], x[j+j-1]=0; /* "square" */
+    for (j=KK+KK-2;j>=KK;j--)
+      x[j-(KK-LL)]=mod_diff(x[j-(KK-LL)],x[j]),
+      x[j-KK]=mod_diff(x[j-KK],x[j]);
+    if (is_odd(ss)) {              /* "multiply by z" */
+      for (j=KK;j>0;j--)  x[j]=x[j-1];
+      x[0]=x[KK];            /* shift the buffer cyclically */
+      x[LL]=mod_diff(x[LL],x[KK]);
+    }
+    if (ss) ss>>=1; else t--;
+  }
+  for (j=0;j<LL;j++) ran_x[j+KK-LL]=x[j];
+  for (;j<KK;j++) ran_x[j-LL]=x[j];
+  for (j=0;j<10;j++) ran_array(x,KK+KK-1); /* warm things up */
+  ran_arr_ptr=&ran_arr_started;
+}
+
+#define ran_arr_next() (*ran_arr_ptr>=0? *ran_arr_ptr++: ran_arr_cycle())
+long ran_arr_cycle()
+{
+  if (ran_arr_ptr==&ran_arr_dummy)
+    ran_start(314159L); /* the user forgot to initialize */
+  ran_array(ran_arr_buf,QUALITY);
+  ran_arr_buf[KK]=-1;
+  ran_arr_ptr=ran_arr_buf+1;
+  return ran_arr_buf[0];
+}
+
+/* Tweaked to include as a library - Fletcher T. Penney */
+/*#include <stdio.h>
+int main()
+{
+  register int m; long a[2009]; 
+  ran_start(310952L);
+  for (m=0;m<=2009;m++) ran_array(a,1009);
+  printf("%ld\n", a[0]);             *//* 995235265 */
+/*  ran_start(310952L);
+  for (m=0;m<=1009;m++) ran_array(a,2009);
+  printf("%ld\n", a[0]);             *//* 995235265 */
+/*  printf("%ld\n",ran_arr_next());
+  return 0;
+} */
+
+long ran_num_next()
+{
+	return ran_arr_next();
+}
+

data/MultiMarkdown-4/rtf.c

@@ -0,0 +1,648 @@
+/*
+
+	rtf.c -- RTF writer
+
+	(c) 2013 Fletcher T. Penney (http://fletcherpenney.net/).
+
+	This program is free software; you can redistribute it and/or modify
+	it under the terms of the GNU General Public License or the MIT
+	license.  See LICENSE for details.
+	
+	This program is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+	GNU General Public License for more details.
+
+*/
+
+#include "rtf.h"
+
+
+/* Since RTF sucks, we simplify here */
+
+#define kNormalStyle "\\s0 \\qj\\sa180\\f0\\fs24 "
+#define kH1 "\\s1 \\f1\\fs32\\ql\\sb240\\sa180\\b "
+#define kH2 "\\s2 \\f1\\fs28\\ql\\sb240\\sa180\\i\\b "
+#define kH3 "\\s3 \\f1\\fs28\\ql\\sb240\\sa180\\b "
+#define kH4 "\\s4 \\f1\\fs24\\ql\\sb240\\sa180\\i\\b "
+#define kH5 "\\s5 \\f1\\fs24\\ql\\sb240\\sa180\\b "
+#define kH6 "\\s6 \\f1\\fs22\\ql\\sb240\\sa180\\b "
+#define kQuoteStyle "\\s7 \\qj\\sa180\\f0\\fs24\\li720\\ri720 "
+#define kNoteStyle "\\s7 \\qj\\sa180\\f0\\fs24\\li360\\ri360 "
+#define kCodeStyle "\\s7 \\qj\\sa180\\f2\\fs20\\li360\\ri360 "
+
+/* print_rtf_node_tree -- convert node tree to RTF */
+void print_rtf_node_tree(GString *out, node *list, scratch_pad *scratch) {
+	while (list != NULL) {
+		print_rtf_node(out, list, scratch);
+		list = list->next;
+	}
+}
+
+/* print_rtf_node -- convert given node to RTF and append */
+void print_rtf_node(GString *out, node *n, scratch_pad *scratch) {
+	int i;
+	int lev;
+	int old_type;
+	char *temp;
+	link_data *temp_link_data;
+	node *temp_node;
+
+	switch (n->key) {
+		case SPACE:
+		case STR:
+		/* TODO: Some of the following need improvements */
+		case MATHSPAN:
+			print_rtf_string(out, n->str, scratch);
+			break;
+		case METADATA:
+			if (scratch->extensions & EXT_SNIPPET)
+				break; 			
+			g_string_append_printf(out, "{\\info\n");
+			print_rtf_node_tree(out,n->children,scratch);
+		 	g_string_append_printf(out, "}\n");
+			scratch->padded = 0;
+			break;
+		case METAKEY:
+			/* Convert key */
+			temp = label_from_string(n->str);
+			free(n->str);
+			n->str = temp;
+			if (strcmp(n->str, "baseheaderlevel") == 0) {
+				scratch->baseheaderlevel = atoi(n->children->str);
+				break;
+			} else if (strcmp(n->str, "rtfheaderlevel") == 0) {
+				scratch->baseheaderlevel = atoi(n->children->str);
+				break;
+			} else if (strcmp(n->str, "quoteslanguage") == 0) {
+				temp = label_from_node_tree(n->children);
+				if ((strcmp(temp, "nl") == 0) || (strcmp(temp, "dutch") == 0)) { scratch->language = DUTCH; }   else 
+				if ((strcmp(temp, "de") == 0) || (strcmp(temp, "german") == 0)) { scratch->language = GERMAN; } else 
+				if (strcmp(temp, "germanguillemets") == 0) { scratch->language = GERMANGUILL; } else 
+				if ((strcmp(temp, "fr") == 0) || (strcmp(temp, "french") == 0)) { scratch->language = FRENCH; } else 
+				if ((strcmp(temp, "sv") == 0) || (strcmp(temp, "swedish") == 0)) { scratch->language = SWEDISH; }
+				free(temp);
+				break;
+			}
+	
+			if (strcmp(n->str, "title") == 0) {
+				g_string_append_printf(out, "{\\title ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "author") == 0) {
+				g_string_append_printf(out, "{\\author ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "affiliation") == 0) {
+				g_string_append_printf(out, "{\\company ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "company") == 0) {
+				g_string_append_printf(out, "{\\company ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "keywords") == 0) {
+				g_string_append_printf(out, "{\\keywords ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "copyright") == 0) {
+				g_string_append_printf(out, "{\\*\\copyright ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "comment") == 0) {
+				g_string_append_printf(out, "{\\doccomm ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			} else if (strcmp(n->str, "subject") == 0) {
+				g_string_append_printf(out, "{\\subject ");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out, "}\n");
+			}
+			break;
+		case METAVALUE:
+			trim_trailing_whitespace(n->str);
+			print_rtf_string(out, n->str, scratch);
+			break;
+		case BLOCKQUOTEMARKER:
+			print_rtf_node_tree(out, n->children, scratch);
+			break;
+		case BLOCKQUOTE:
+			old_type = scratch->odf_para_type;
+			scratch->odf_para_type = BLOCKQUOTE;
+			pad_rtf(out, 2, scratch);
+			print_rtf_node_tree(out,n->children,scratch);
+			scratch->padded = 1;
+			scratch->odf_para_type = old_type;
+			break;
+		case VERBATIM:
+			pad_rtf(out, 2, scratch);
+			g_string_append_printf(out, "{\\pard " kCodeStyle);
+			print_rtf_code_string(out,n->str,scratch);
+			g_string_append_printf(out, "\n\\par}\n");
+			scratch->padded = 0;
+			break;
+		case CODE:
+			print_rtf_node_tree(out,n->children,scratch);
+//			print_rtf_string(out, n->str, scratch);
+			break;
+		case PARA:
+			pad_rtf(out, 2, scratch);
+			switch (scratch->odf_para_type) {
+				case BLOCKQUOTE:
+					g_string_append_printf(out, "{\\pard " kQuoteStyle);
+					break;
+				case NOTEREFERENCE:
+				case CITATION:
+					g_string_append_printf(out, "{\\pard " kNoteStyle);
+					break;
+				case CODE:
+				case VERBATIM:
+					g_string_append_printf(out, "{\\pard " kCodeStyle);
+					break;
+				default:
+					g_string_append_printf(out, "{\\pard " kNormalStyle);
+					break;
+			}
+			print_rtf_node_tree(out,n->children,scratch);
+			g_string_append_printf(out, "\n\\par}\n");
+			scratch->padded = 1;
+			break;
+		case H1: case H2: case H3: case H4: case H5: case H6:
+			lev = n->key - H1 + scratch->baseheaderlevel;
+			if (lev > 6)
+				lev = 6;
+			pad_rtf(out, 2, scratch);
+			switch (lev) {
+				case 1:
+					g_string_append_printf(out, "{\\pard " kH1);
+					break;
+				case 2:
+					g_string_append_printf(out, "{\\pard " kH2);
+					break;
+				case 3:
+					g_string_append_printf(out, "{\\pard " kH3);
+					break;
+				case 4:
+					g_string_append_printf(out, "{\\pard " kH4);
+					break;
+				case 5:
+					g_string_append_printf(out, "{\\pard " kH5);
+					break;
+				case 6:
+					g_string_append_printf(out, "{\\pard " kH6);
+					break;
+			}
+			if (n->children->key == AUTOLABEL) {
+				temp = label_from_string(n->children->str);
+				g_string_append_printf(out, "{\\*\\bkmkstart %s}{\\*\\bkmkend %s}",temp, temp);
+				print_rtf_node_tree(out, n->children->next, scratch);
+			} else {
+				temp = label_from_node_tree(n->children);
+				g_string_append_printf(out, "{\\*\\bkmkstart %s}{\\*\\bkmkend %s}",temp,temp);
+				print_rtf_node_tree(out, n->children, scratch);
+			}
+			free(temp);
+			g_string_append_printf(out, "\\par}\n");
+			scratch->padded = 1;
+			break;
+		case TABLE:
+			if ((n->children != NULL) && (n->children->key == TABLECAPTION)) {
+				if (n->children->children->key == TABLELABEL) {
+					temp = label_from_string(n->children->children->str);
+				} else {
+					temp = label_from_node_tree(n->children->children);
+				}
+				g_string_append_printf(out, "{\\*\\bkmkstart %s}{\\*\\bkmkend %s}",temp,temp);
+				free(temp);
+			}
+			pad_rtf(out, 2, scratch);
+			print_rtf_node_tree(out, n->children, scratch);
+			if ((n->children != NULL) && (n->children->key == TABLECAPTION)) {
+				g_string_append_printf(out, "{\\pard " kNormalStyle "\\qc ");
+				print_rtf_node_tree(out, n->children->children, scratch);
+				g_string_append_printf(out, "\\par}\n");
+			}
+			g_string_append_printf(out, "\\pard\\par\n");
+			scratch->padded = 1;
+			break;
+		case TABLELABEL:
+		case TABLECAPTION:
+			break;
+		case TABLESEPARATOR:
+			scratch->table_alignment = n->str;
+			break;
+		case TABLEHEAD:
+			scratch->cell_type = 'h';
+			print_rtf_node_tree(out, n->children, scratch);
+			scratch->cell_type = 'd';
+			break;
+		case TABLEROW:
+			scratch->table_column = 0;
+			g_string_append_printf(out, "\\trowd\\trautofit1\n");
+			for (i=0; i < strlen(scratch->table_alignment); i++) {
+				g_string_append_printf(out, "\\cellx%d\n",i+1);
+			}
+			print_rtf_node_tree(out, n->children, scratch);
+			g_string_append_printf(out, "\\row\n");
+			break;
+		case TABLECELL:
+			temp = scratch->table_alignment;
+			if (strncmp(&temp[scratch->table_column],"h",1) == 0) {
+				scratch->table_column++;
+			}
+			lev = scratch->table_column;
+	
+			g_string_append_printf(out, "\\intbl");
+
+			if (scratch->cell_type == 'h') {
+				g_string_append_printf(out, "\\qc{\\b ");
+			} else {
+				if ( strncmp(&temp[lev],"r",1) == 0) {
+					g_string_append_printf(out, "\\qr");
+				} else if ( strncmp(&temp[lev],"R",1) == 0) {
+					g_string_append_printf(out, "\\qr");
+				} else if ( strncmp(&temp[lev],"c",1) == 0) {
+					g_string_append_printf(out, "\\qc");
+				} else if ( strncmp(&temp[lev],"C",1) == 0) {
+					g_string_append_printf(out, "\\qc");
+				} else {
+					g_string_append_printf(out, "\\ql");
+				}
+			}
+			g_string_append_printf(out, " {");
+			print_rtf_node_tree(out, n->children, scratch);
+
+			if (scratch->cell_type == 'h')
+				g_string_append_printf(out, "}");
+
+			g_string_append_printf(out, "}\\cell\n");
+			scratch->table_column++;
+			break;
+		case STRONG:
+			g_string_append_printf(out, "{\\b ");
+			print_rtf_node_tree(out,n->children,scratch);
+			g_string_append_printf(out, "}");
+			break;
+		case EMPH:
+			g_string_append_printf(out, "{\\i ");
+			print_rtf_node_tree(out,n->children,scratch);
+			g_string_append_printf(out, "}");
+			break;
+		case LINEBREAK:
+			g_string_append_printf(out, "\\line ");
+			break;
+		case LINK:
+			temp_link_data = load_link_data(n, scratch);
+
+			if (temp_link_data == NULL) {
+				/* replace original text since no definition found */
+				g_string_append_printf(out, "[");
+				print_rtf_node(out, n->children, scratch);
+				g_string_append_printf(out,"]");
+				if (n->children->next != NULL) {
+					g_string_append_printf(out, "[");
+					print_rtf_node_tree(out, n->children->next, scratch);
+					g_string_append_printf(out,"]");
+				} else if (n->str != NULL) {
+					/* no title label, so see if we stashed str*/
+					g_string_append_printf(out, "%s", n->str);
+				} else {
+					g_string_append_printf(out, "[%s]",n->link_data->label);
+				}
+
+				free_link_data(temp_link_data);
+				break;
+			}
+
+			/* Insert link */
+			g_string_append_printf(out, "{\\field{\\*\\fldinst{HYPERLINK \"");
+			print_rtf_string(out, temp_link_data->source, scratch);
+			g_string_append_printf(out, "\"}}{\\fldrslt ");
+			if (n->children != NULL)
+				print_rtf_node_tree(out, n->children, scratch);
+			g_string_append_printf(out, "}}");
+
+			free(temp_link_data);
+			break;
+		case BULLETLIST:
+			pad(out, 2, scratch);
+			g_string_append_printf(out, "\\ls1\\ilvl0 ");
+			scratch->padded = 0;
+			print_rtf_node_tree(out, n->children, scratch);
+			break;
+		case ORDEREDLIST:
+			pad(out, 2, scratch);
+			scratch->padded = 0;
+			print_rtf_node_tree(out, n->children, scratch);
+			break;
+		case LISTITEM:
+			g_string_append_printf(out, "{\\listtext \\'95 }");
+			print_rtf_node_tree(out, n->children, scratch);
+			break;
+		case NOTEREFERENCE:
+			lev = note_number_for_node(n, scratch);
+			temp_node = node_for_count(scratch->used_notes, lev);
+			scratch->padded = 2;
+
+			g_string_append_printf(out, "{\\super\\chftn}{\\footnote\\pard\\plain\\chtfn ");
+			print_rtf_node_tree(out, temp_node->children, scratch);
+			g_string_append_printf(out, "}");
+			scratch->padded = 0;
+			break;
+		case GLOSSARYTERM:
+			print_rtf_string(out, n->children->str, scratch);
+			g_string_append_printf(out, ": ");
+			break;
+		case GLOSSARYSORTKEY:
+			break;
+		case NOCITATION:
+		case CITATION:
+			if ((n->link_data != NULL) && (strncmp(n->link_data->label,"[#",2) == 0)) {
+				/* external citation */
+				g_string_append_printf(out, "%s", n->link_data->label);
+			} else {
+				/* MMD citation, so output as endnote */
+				scratch->printing_notes = 1;
+				lev = 0;
+				if (n->link_data != NULL)
+					lev = note_number_for_label(n->link_data->label, scratch);
+				if (lev != 0) {
+					temp_node = node_for_count(scratch->used_notes, lev);
+					
+					/* flag that this is used as a citation */
+					temp_node->key = CITATIONSOURCE;
+					if (lev > scratch->max_footnote_num) {
+						/* first use of this citation */
+						scratch->max_footnote_num = lev;
+						
+						old_type = scratch->odf_para_type;
+						scratch->odf_para_type = CITATION;
+						
+						/* change to represent cite count only */
+						lev = cite_count_node_from_end(temp_node);
+						g_string_append_printf(out, "{\\super\\chftn}{\\footnote\\ftnalt\\pard\\plain\\chtfn ");
+						scratch->padded = 2;
+						if (temp_node->children != NULL) {
+							print_rtf_node(out, temp_node->children, scratch);
+						}
+						pad(out, 1, scratch);
+						g_string_append_printf(out, "}");
+						scratch->odf_para_type = old_type;
+					} else {
+						/* We are reusing a previous citation */
+
+						/* Change lev to represent cite count only */
+						lev = cite_count_node_from_end(temp_node);
+					
+						g_string_append_printf(out, "REUSE CITATION");
+					}
+				} else {
+					/* not located -- this is external cite */
+
+					if ((n->link_data != NULL) && (n->key == NOCITATION)) {
+						g_string_append_printf(out, "%s", n->link_data->label);
+					} else if (n->link_data != NULL) {
+						g_string_append_printf(out, "[");
+						if (n->children != NULL) {
+							print_rtf_node(out, n->children, scratch);
+							g_string_append_printf(out, "][");
+						}
+						g_string_append_printf(out, "#%s]",n->link_data->label);
+					}
+				}
+			}
+			scratch->printing_notes = 0;
+			if ((n->next != NULL) && (n->next->key == CITATION)) {
+				g_string_append_printf(out, " ");
+			}
+			break;
+		case APOSTROPHE:
+			print_rtf_localized_typography(out, APOS, scratch);
+			break;
+		case ELLIPSIS:
+			print_rtf_localized_typography(out, ELLIP, scratch);
+			break;
+		case EMDASH:
+			print_rtf_localized_typography(out, MDASH, scratch);
+			break;
+		case ENDASH:
+			print_rtf_localized_typography(out, NDASH, scratch);
+			break;
+		case SINGLEQUOTED:
+			print_rtf_localized_typography(out, LSQUOTE, scratch);
+			print_rtf_node_tree(out, n->children, scratch);
+			print_rtf_localized_typography(out, RSQUOTE, scratch);
+			break;
+		case DOUBLEQUOTED:
+			print_rtf_localized_typography(out, LDQUOTE, scratch);
+			print_rtf_node_tree(out, n->children, scratch);
+			print_rtf_localized_typography(out, RDQUOTE, scratch);
+			break;
+		case LIST:
+		case HEADINGSECTION:
+			print_rtf_node_tree(out,n->children,scratch);
+			break;
+		/* TODO: Some of the following need improvements */
+		case TABLEBODY:
+		case PLAIN:
+			print_rtf_node_tree(out,n->children,scratch);
+			g_string_append_printf(out, "\\\n");
+			break;
+		case NOTELABEL:
+		case FOOTER:
+		case LINKREFERENCE:
+			break;
+		case GLOSSARYSOURCE:
+		case CITATIONSOURCE:
+		case NOTESOURCE:
+			if (scratch->printing_notes)
+				print_html_node_tree(out, n->children, scratch);
+			break;
+		case IMAGEBLOCK:
+		case IMAGE:
+			g_string_append_printf(out, "IMAGES CANNOT BE INSERTED INTO AN RTF DOCUMENT FROM MULTIMARKDOWN \\\n");
+			break;
+		case VARIABLE:
+			temp = metavalue_for_key(n->str,scratch->result_tree);
+			if (temp == NULL) {
+				g_string_append_printf(out, "[%%%s]",n->str);
+			} else {
+				g_string_append_printf(out, temp);
+				free(temp);
+			}
+			break;
+		default:
+			fprintf(stderr, "print_rtf_node encountered unknown node key = %d\n",n->key);
+			g_string_append_printf(out, "%s",n->str);
+			/* Will use in place of real output during development */
+			/* exit(EXIT_FAILURE); */
+			break;
+	}
+}
+
+void begin_rtf_output(GString *out, node* list, scratch_pad *scratch) {
+	g_string_append_printf(out, "{\\rtf1\\ansi\\deff0 {\\fonttbl\n" \
+		"{\\f0\\froman Times New Roman;}\n" \
+		"{\\f1\\fswiss Arial;}\n" \
+		"{\\f2\\fmodern Courier New;}\n" \
+		"}\n" \
+		"{\\stylesheet\n" \
+		"{" kNormalStyle "Normal;}\n" \
+		"{" kH1 "Header 1;}\n" \
+		"{" kH2 "Header 2;}\n" \
+		"{" kH3 "Header 3;}\n" \
+		"{" kH4 "Header 4;}\n" \
+		"{" kH5 "Header 5;}\n" \
+		"{" kH6 "Header 6;}\n" \
+		"{" kQuoteStyle "Quotation;}\n" \
+		"{" kNoteStyle "Note;}\n" \
+		"}\n" \
+		"\\margt1150\\margb1150\\margl1150\\margr1150\n");
+}
+
+void end_rtf_output(GString *out, node* list, scratch_pad *scratch) {
+	g_string_append_printf(out, "}\n");}
+
+/* print_rtf_localized_typography -- convert to "smart" typography */
+void print_rtf_localized_typography(GString *out, int character, scratch_pad *scratch) {
+	if (!extension(EXT_SMART, scratch->extensions)) {
+		g_string_append_c(out, character);
+		return;
+	}
+	switch (character) {
+		case LSQUOTE:
+			switch (scratch->language) {
+				case SWEDISH:
+					g_string_append_printf(out, "&#8217;");
+					break;
+				case FRENCH:
+					g_string_append_printf(out,"&#39;");
+					break;
+				case GERMAN:
+					g_string_append_printf(out,"&#8218;");
+					break;
+				case GERMANGUILL:
+					g_string_append_printf(out,"&#8250;");
+					break;
+				default:
+					g_string_append_printf(out,"\\'91");
+				}
+			break;
+		case RSQUOTE:
+			switch (scratch->language) {
+				case GERMAN:
+					g_string_append_printf(out,"&#8216;");
+					break;
+				case GERMANGUILL:
+					g_string_append_printf(out,"&#8249;");
+					break;
+				default:
+					g_string_append_printf(out,"\\'92");
+				}
+			break;
+		case APOS:
+			g_string_append_printf(out,"\\'27");
+			break;
+		case LDQUOTE:
+			switch (scratch->language) {
+				case DUTCH:
+				case GERMAN:
+					g_string_append_printf(out,"&#8222;");
+					break;
+				case GERMANGUILL:
+					g_string_append_printf(out,"&#187;");
+					break;
+				case FRENCH:
+					g_string_append_printf(out,"&#171;");
+					break;
+				case SWEDISH:
+					g_string_append_printf(out, "&#8221;");
+					break;
+				default:
+					g_string_append_printf(out,"\\'93");
+				}
+			break;
+		case RDQUOTE:
+			switch (scratch->language) {
+				case SWEDISH:
+				case DUTCH:
+					g_string_append_printf(out,"&#8221;");
+					break;
+				case GERMAN:
+					g_string_append_printf(out,"&#8220;");
+					break;
+				case GERMANGUILL:
+					g_string_append_printf(out,"&#171;");
+					break;
+				case FRENCH:
+					g_string_append_printf(out,"&#187;");
+					break;
+				default:
+					g_string_append_printf(out,"\\'94");
+				}
+			break;
+		case NDASH:
+			g_string_append_printf(out,"\\'96");
+			break;
+		case MDASH:
+			g_string_append_printf(out,"\\'97");
+			break;
+		case ELLIP:
+			g_string_append_printf(out,"\\'85");
+			break;
+			default:;
+	}
+}
+
+void print_rtf_string(GString *out, char *str, scratch_pad *scratch) {
+	if (str == NULL)
+		return;
+	while (*str != '\0') {
+		switch (*str) {
+			case '\\':
+				g_string_append_printf(out, "\\\\");
+				break;
+			case '{':
+				g_string_append_printf(out, "\\{");
+				break;
+			case '}':
+				g_string_append_printf(out, "\\}");
+				break;
+			case '\n':
+				g_string_append_printf(out, " \n");
+			default:
+				g_string_append_c(out, *str);
+		}
+		str++;
+	}
+}
+
+void print_rtf_code_string(GString *out, char *str, scratch_pad *scratch) {
+	if (str == NULL)
+		return;
+	while (*str != '\0') {
+		switch (*str) {
+			case '\\':
+				g_string_append_printf(out, "\\\\");
+				break;
+			case '{':
+				g_string_append_printf(out, "\\{");
+				break;
+			case '}':
+				g_string_append_printf(out, "\\}");
+				break;
+			case '\n':
+				g_string_append_printf(out, "\\\n");
+				break;
+			default:
+				g_string_append_c(out, *str);
+		}
+		str++;
+	}
+}
+void pad_rtf(GString *out, int num, scratch_pad *scratch) {
+	while (num-- > scratch->padded)
+		g_string_append_printf(out, "\n");
+	
+	scratch->padded = num;
+}