1 .\" $Id: man.3,v 1.24 2010/08/20 01:02:07 schwarze 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: August 20 2010 $
29 .Nd man macro compiler library
33 .Vt extern const char * const * man_macronames;
36 .Fa "struct regset *regs"
41 .Fn man_endparse "struct man *man"
43 .Fn man_free "struct man *man"
44 .Ft "const struct man_meta *"
45 .Fn man_meta "const struct man *man"
46 .Ft "const struct man_node *"
47 .Fn man_node "const struct man *man"
55 .Fn man_reset "struct man *man"
59 library parses lines of
61 input into an abstract syntax tree (AST).
63 In general, applications initiate a parsing sequence with
65 parse each line in a document with
67 close the parsing session with
69 operate over the syntax tree returned by
73 then free all allocated memory with
77 function may be used in order to reset the parser for another input
81 section for a full example.
83 Beyond the full set of macros defined in
87 library also accepts the following macros:
89 .Bl -tag -width Ds -compact
91 Has no effect. Handled as a current-scope line macro.
95 .Pq part of the standard preamble for Perl documentation .
96 Handled as a line macro.
100 .Pq part of the standard preamble for Perl documentation .
101 Handled as a current-scope line macro.
107 .Pq part of the standard preamble for Perl documentation .
108 Handled as a current-scope line macro.
111 Furthermore, the following escapes are accepted to allow
113 documents to be correctly formatted:
116 \e*(L" (left double-quote),
117 \e*(R" (right double-quote),
118 \e*(C` (left single-quote),
119 \e*(C' (right single-quote),
124 \e*/ (forward slash),
134 This section further defines the
139 available to programmers.
141 .Sx Abstract Syntax Tree
142 section documents the output tree.
148 may use the following types:
151 An opaque type defined in
153 Its values are only used privately within the library.
155 A function callback type defined in
157 .It Vt struct man_node
162 .Sx Abstract Syntax Tree
166 Function descriptions follow:
169 Allocates a parsing structure.
174 Returns NULL on failure.
175 If non-NULL, the pointer must be freed with
178 Reset the parser for another parse routine.
181 behaves as if invoked for the first time.
183 Free all resources of a parser.
184 The pointer is no longer valid after invocation.
186 Parse a nil-terminated line of input.
187 This line should not contain the trailing newline.
188 Returns 0 on failure, 1 on success.
191 is modified by this function.
193 Signals that the parse is complete.
196 is called subsequent to
198 the resulting tree is incomplete.
199 Returns 0 on failure, 1 on success.
201 Returns the first node of the parse.
206 return 0, the tree will be incomplete.
208 Returns the document's parsed meta-data.
209 If this information has not yet been supplied or
213 return 0, the data will be incomplete.
216 The following variables are also defined:
218 .It Va man_macronames
219 An array of string-ified token names.
221 .Ss Abstract Syntax Tree
224 functions produce an abstract syntax tree (AST) describing input in a
226 It may be reviewed at any time with
228 however, if called before
234 fail, it may be incomplete.
236 This AST is governed by the ontological rules dictated in
238 and derives its terminology accordingly.
240 The AST is composed of
242 nodes with element, root and text types as declared by the
245 Each node also provides its parse point (the
250 fields), its position in the tree (the
256 fields) and some type-specific data.
258 The tree itself is arranged according to the following normal form,
259 where capitalised non-terminals represent nodes.
261 .Bl -tag -width "ELEMENTXX" -compact
265 \(<- ELEMENT | TEXT | BLOCK
278 The only elements capable of nesting other elements are those with
279 next-lint scope as documented in
282 The following example reads lines from stdin and parses them, operating
283 on the finished parse tree with
285 This example does not error-check nor free memory upon failure.
286 .Bd -literal -offset indent
289 struct man_node *node;
294 bzero(®s, sizeof(struct regset));
296 man = man_alloc(®s, NULL, NULL);
300 while ((len = getline(&buf, &alloc_len, stdin)) >= 0) {
301 if (len && buflen[len - 1] = '\en')
302 buf[len - 1] = '\e0';
303 if ( ! man_parseln(man, line, buf))
304 errx(1, "man_parseln");
310 if ( ! man_endparse(man))
311 errx(1, "man_endparse");
312 if (NULL == (node = man_node(man)))
321 in the source archive for a rigorous reference.
328 library was written by
329 .An Kristaps Dzonsons Aq kristaps@bsd.lv .