1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/* $Id: eqn_html.c,v 1.5 2014/09/28 13:34:15 kristaps Exp $ */
/*
* Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include "config.h"
#include <sys/types.h>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "mandoc.h"
#include "out.h"
#include "html.h"
static const enum htmltag fontmap[EQNFONT__MAX] = {
TAG_SPAN, /* EQNFONT_NONE */
TAG_SPAN, /* EQNFONT_ROMAN */
TAG_B, /* EQNFONT_BOLD */
TAG_B, /* EQNFONT_FAT */
TAG_I /* EQNFONT_ITALIC */
};
static const struct eqn_box *
eqn_box(struct html *, const struct eqn_box *, int);
void
print_eqn(struct html *p, const struct eqn *ep)
{
struct htmlpair tag;
struct tag *t;
PAIR_CLASS_INIT(&tag, "eqn");
t = print_otag(p, TAG_MATH, 1, &tag);
p->flags |= HTML_NONOSPACE;
eqn_box(p, ep->root, 1);
p->flags &= ~HTML_NONOSPACE;
print_tagq(p, t);
}
/*
* This function is fairly brittle.
* This is because the eqn syntax doesn't play so nicely with recusive
* formats, e.g.,
* foo sub bar sub baz
* ...needs to resolve into
* <msub> foo <msub> bar, baz </msub> </msub>
* In other words, we need to embed some recursive work.
* FIXME: this does NOT handle right-left associativity or precedence!
*/
static const struct eqn_box *
eqn_box(struct html *p, const struct eqn_box *bp, int next)
{
struct tag *post, *pilet, *tmp;
struct htmlpair tag[2];
int skiptwo;
if (NULL == bp)
return(NULL);
post = pilet = NULL;
skiptwo = 0;
/*
* If we're a "row" under a pile, then open up the piling
* context here.
* We do this first because the pile surrounds the content of
* the contained expression.
*/
if (NULL != bp->parent && bp->parent->pile != EQNPILE_NONE) {
pilet = print_otag(p, TAG_MTR, 0, NULL);
print_otag(p, TAG_MTD, 0, NULL);
}
/*
* If we're establishing a pile, start the table mode now.
* If we've already in a pile row, then don't override "pilet",
* because we'll be closed out anyway.
*/
if (bp->pile != EQNPILE_NONE) {
tmp = print_otag(p, TAG_MTABLE, 0, NULL);
pilet = (NULL == pilet) ? tmp : pilet;
}
/*
* Positioning.
* This is the most complicated part, and actually doesn't quite
* work (FIXME) because it doesn't account for associativity.
* Setting "post" will mean that we're only going to process a
* single or double following expression.
*/
switch (bp->pos) {
case (EQNPOS_SUP):
post = print_otag(p, TAG_MSUP, 0, NULL);
break;
case (EQNPOS_FROM):
/* FALLTHROUGH */
case (EQNPOS_SUB):
post = print_otag(p, TAG_MSUB, 0, NULL);
break;
case (EQNPOS_OVER):
post = print_otag(p, TAG_MFRAC, 0, NULL);
break;
case (EQNPOS_SUBSUP):
/* This requires two elements. */
post = print_otag(p, TAG_MSUBSUP, 0, NULL);
skiptwo = 1;
break;
default:
break;
}
/*t = EQNFONT_NONE == bp->font ? NULL :
print_otag(p, fontmap[(int)bp->font], 0, NULL);*/
if (NULL != bp->text) {
assert(NULL == bp->first);
/*
* We have text.
* This can be a number, a function, a variable, or
* pretty much anything else.
* First, check for some known functions.
* If we're going to create a structural node (e.g.,
* sqrt), then set the "post" variable only if it's not
* already set.
*/
if (0 == strcmp(bp->text, "sqrt")) {
tmp = print_otag(p, TAG_MSQRT, 0, NULL);
post = (NULL == post) ? tmp : post;
} else if (0 == strcmp(bp->text, "+") ||
0 == strcmp(bp->text, "-") ||
0 == strcmp(bp->text, "=") ||
0 == strcmp(bp->text, "(") ||
0 == strcmp(bp->text, ")") ||
0 == strcmp(bp->text, "/")) {
tmp = print_otag(p, TAG_MO, 0, NULL);
print_text(p, bp->text);
print_tagq(p, tmp);
} else {
tmp = print_otag(p, TAG_MI, 0, NULL);
print_text(p, bp->text);
print_tagq(p, tmp);
}
} else if (NULL != bp->first) {
assert(NULL == bp->text);
/*
* If we're a "fenced" component (i.e., having
* brackets), then process those brackets now.
* Otherwise, introduce a dummy row (if we're not
* already in a table context).
*/
tmp = NULL;
if (NULL != bp->left || NULL != bp->right) {
PAIR_INIT(&tag[0], ATTR_OPEN,
NULL != bp->left ? bp->left : "");
PAIR_INIT(&tag[1], ATTR_CLOSE,
NULL != bp->right ? bp->right : "");
tmp = print_otag(p, TAG_MFENCED, 2, tag);
print_otag(p, TAG_MROW, 0, NULL);
} else if (NULL == pilet)
tmp = print_otag(p, TAG_MROW, 0, NULL);
eqn_box(p, bp->first, 1);
if (NULL != tmp)
print_tagq(p, tmp);
}
/*
* If a positional context, invoke the "next" context.
* This is recursive and will return the end of the recursive
* chain of "next" contexts.
*/
if (NULL != post) {
bp = eqn_box(p, bp->next, 0);
if (skiptwo)
bp = eqn_box(p, bp->next, 0);
print_tagq(p, post);
}
/*
* If we're being piled (either directly, in the table, or
* indirectly in a table row), then close that out.
*/
if (NULL != pilet)
print_tagq(p, pilet);
/*
* If we're normally processing, then grab the next node.
* If we're in a recursive context, then don't seek to the next
* node; further recursion has already been handled.
*/
return(next ? eqn_box(p, bp->next, 1) : bp);
}
|
