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
|
#include "creole.h"
#include <assert.h>
#include <ctype.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#define LENGTH(x) (sizeof(x)/sizeof((x)[0]))
#define DEBUG(...) (fprintf(stderr, __VA_ARGS__), fflush(stderr))
void process(const char *begin, const char *end, bool new_block, FILE *out);
int do_headers(const char *begin, const char *end, bool new_block, FILE *out);
// A parser takes a (sub)string and returns the number of characters consumed, if any.
//
// The parameter `new_block` determines whether `begin` points to the beginning of a new block.
// The sign of the return value determines whether a new block should begin, after the consumed text.
typedef int (* parser_t)(const char *begin, const char *end, bool new_block, FILE *out);
static parser_t parsers[] = { do_headers };
int do_headers(const char *begin, const char *end, bool new_block, FILE *out) {
if (!new_block) { // Headers are block-level elements.
return 0;
}
if (*begin != '=') {
return 0;
}
unsigned level = 0;
const char *start = begin;
while (*start == '=') {
level += 1;
start += 1;
}
if (level > 6) {
return 0;
}
while (isspace(*start)) {
start += 1;
}
const char *eol = start;
while (eol != end && *eol != '\n') {
eol += 1;
}
const char *stop = eol;
assert(stop > begin);
while (stop[-1] == '=' || isspace(stop[-1])) {
stop -= 1;
}
fprintf(out, "<h%u>", level);
process(start, stop, false, out);
fprintf(out, "</h%u>", level);
return -(eol - begin);
}
void process(const char *begin, const char *end, bool new_block, FILE *out) {
const char *p = begin;
while (p < end) {
// Eat all newlines if we're starting a block.
if (new_block) {
while (*p == '\n') {
p += 1;
if (p == end) {
return;
}
}
}
// Greedily try all parsers.
int affected;
for (unsigned i = 0; i < LENGTH(parsers); ++i) {
affected = parsers[i](p, end, new_block, out);
if (affected) {
break;
}
}
if (affected) {
p += abs(affected);
} else {
fputc(*p, out);
p += 1;
}
if (p + 1 == end) {
// Don't print single newline at end.
if (*p == '\n') {
return;
}
} else {
// Determine whether we've reached a new block.
if (p[0] == '\n' && p[1] == '\n') {
// Double newline characters separate blocks;
// if we've found them, we're starting a new block
new_block = true;
} else {
// ...otherwise the parser gets to decide.
new_block = affected < 0;
}
}
}
}
void render_creole(FILE *out, const char *source, size_t source_length)
{
process(source, source + source_length, true, out);
}
|
