1 .\" $Id: man.3,v 1.22 2010/07/07 15:04:54 kristaps Exp $
3 .\" Copyright (c) 2009-2010 Kristaps Dzonsons <kristaps@bsd.lv>
5 .\" Permission to use, copy, modify, and distribute this software for any
6 .\" purpose with or without fee is hereby granted, provided that the above
7 .\" copyright notice and this permission notice appear in all copies.
9 .\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10 .\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 .\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12 .\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 .\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 .\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15 .\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 .Dd $Mdocdate: July 7 2010 $
29 .Nd man macro compiler library
33 .Vt extern const char * const * man_macronames;
36 .Fa "struct regset *regs"
42 .Fn man_endparse "struct man *man"
44 .Fn man_free "struct man *man"
45 .Ft "const struct man_meta *"
46 .Fn man_meta "const struct man *man"
47 .Ft "const struct man_node *"
48 .Fn man_node "const struct man *man"
56 .Fn man_reset "struct man *man"
60 library parses lines of
62 input into an abstract syntax tree (AST).
64 In general, applications initiate a parsing sequence with
66 parse each line in a document with
68 close the parsing session with
70 operate over the syntax tree returned by
74 then free all allocated memory with
78 function may be used in order to reset the parser for another input
82 section for a full example.
84 Beyond the full set of macros defined in
88 library also accepts the following macros:
90 .Bl -tag -width Ds -compact
92 Has no effect. Handled as a current-scope line macro.
96 .Pq part of the standard preamble for Perl documentation .
97 Handled as a line macro.
101 .Pq part of the standard preamble for Perl documentation .
102 Handled as a current-scope line macro.
108 .Pq part of the standard preamble for Perl documentation .
109 Handled as a current-scope line macro.
112 Furthermore, the following escapes are accepted to allow
114 documents to be correctly formatted:
117 \e*(L" (left double-quote),
118 \e*(R" (right double-quote),
120 \e*(C` (left single-quote),
121 \e*(C' (right single-quote),
126 \e*/ (forward slash),
136 This section further defines the
141 available to programmers.
143 .Sx Abstract Syntax Tree
144 section documents the output tree.
150 may use the following types:
153 An opaque type defined in
155 Its values are only used privately within the library.
157 A function callback type defined in
159 .It Vt struct man_node
164 .Sx Abstract Syntax Tree
168 Function descriptions follow:
171 Allocates a parsing structure.
178 arguments are defined in
180 Returns NULL on failure.
181 If non-NULL, the pointer must be freed with
184 Reset the parser for another parse routine.
187 behaves as if invoked for the first time.
189 Free all resources of a parser.
190 The pointer is no longer valid after invocation.
192 Parse a nil-terminated line of input.
193 This line should not contain the trailing newline.
194 Returns 0 on failure, 1 on success.
197 is modified by this function.
199 Signals that the parse is complete.
202 is called subsequent to
204 the resulting tree is incomplete.
205 Returns 0 on failure, 1 on success.
207 Returns the first node of the parse.
212 return 0, the tree will be incomplete.
214 Returns the document's parsed meta-data.
215 If this information has not yet been supplied or
219 return 0, the data will be incomplete.
222 The following variables are also defined:
224 .It Va man_macronames
225 An array of string-ified token names.
227 .Ss Abstract Syntax Tree
230 functions produce an abstract syntax tree (AST) describing input in a
232 It may be reviewed at any time with
234 however, if called before
240 fail, it may be incomplete.
242 This AST is governed by the ontological rules dictated in
244 and derives its terminology accordingly.
246 The AST is composed of
248 nodes with element, root and text types as declared by the
251 Each node also provides its parse point (the
256 fields), its position in the tree (the
262 fields) and some type-specific data.
264 The tree itself is arranged according to the following normal form,
265 where capitalised non-terminals represent nodes.
267 .Bl -tag -width "ELEMENTXX" -compact
271 \(<- ELEMENT | TEXT | BLOCK
284 The only elements capable of nesting other elements are those with
285 next-lint scope as documented in
288 The following example reads lines from stdin and parses them, operating
289 on the finished parse tree with
291 This example does not error-check nor free memory upon failure.
292 .Bd -literal -offset indent
295 struct man_node *node;
300 bzero(®s, sizeof(struct regset));
302 man = man_alloc(®s, NULL, 0, NULL);
306 while ((len = getline(&buf, &alloc_len, stdin)) >= 0) {
307 if (len && buflen[len - 1] = '\en')
308 buf[len - 1] = '\e0';
309 if ( ! man_parseln(man, line, buf))
310 errx(1, "man_parseln");
316 if ( ! man_endparse(man))
317 errx(1, "man_endparse");
318 if (NULL == (node = man_node(man)))
327 in the source archive for a rigorous reference.
334 library was written by
335 .An Kristaps Dzonsons Aq kristaps@bsd.lv .