1 .\" $Id: man.3,v 1.21 2010/06/27 16:18:13 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: June 27 2010 $
29 .Nd man macro compiler library
34 .Vt extern const char * const * man_macronames;
37 .Fa "struct regset *regs"
43 .Fn man_endparse "struct man *man"
45 .Fn man_free "struct man *man"
46 .Ft "const struct man_meta *"
47 .Fn man_meta "const struct man *man"
48 .Ft "const struct man_node *"
49 .Fn man_node "const struct man *man"
57 .Fn man_reset "struct man *man"
61 library parses lines of
63 input into an abstract syntax tree (AST).
65 In general, applications initiate a parsing sequence with
67 parse each line in a document with
69 close the parsing session with
71 operate over the syntax tree returned by
75 then free all allocated memory with
79 function may be used in order to reset the parser for another input
83 section for a full example.
85 Beyond the full set of macros defined in
89 library also accepts the following macros:
91 .Bl -tag -width Ds -compact
93 Has no effect. Handled as a current-scope line macro.
97 .Pq part of the standard preamble for Perl documentation .
98 Handled as a line macro.
102 .Pq part of the standard preamble for Perl documentation .
103 Handled as a current-scope line macro.
109 .Pq part of the standard preamble for Perl documentation .
110 Handled as a current-scope line macro.
113 Furthermore, the following escapes are accepted to allow
115 documents to be correctly formatted:
118 \e*(L" (left double-quote),
119 \e*(R" (right double-quote),
121 \e*(C` (left single-quote),
122 \e*(C' (right single-quote),
127 \e*/ (forward slash),
137 This section further defines the
142 available to programmers.
144 .Sx Abstract Syntax Tree
145 section documents the output tree.
151 may use the following types:
154 An opaque type defined in
156 Its values are only used privately within the library.
158 A function callback type defined in
160 .It Vt struct man_node
165 .Sx Abstract Syntax Tree
169 Function descriptions follow:
172 Allocates a parsing structure.
179 arguments are defined in
181 Returns NULL on failure.
182 If non-NULL, the pointer must be freed with
185 Reset the parser for another parse routine.
188 behaves as if invoked for the first time.
190 Free all resources of a parser.
191 The pointer is no longer valid after invocation.
193 Parse a nil-terminated line of input.
194 This line should not contain the trailing newline.
195 Returns 0 on failure, 1 on success.
198 is modified by this function.
200 Signals that the parse is complete.
203 is called subsequent to
205 the resulting tree is incomplete.
206 Returns 0 on failure, 1 on success.
208 Returns the first node of the parse.
213 return 0, the tree will be incomplete.
215 Returns the document's parsed meta-data.
216 If this information has not yet been supplied or
220 return 0, the data will be incomplete.
223 The following variables are also defined:
225 .It Va man_macronames
226 An array of string-ified token names.
228 .Ss Abstract Syntax Tree
231 functions produce an abstract syntax tree (AST) describing input in a
233 It may be reviewed at any time with
235 however, if called before
241 fail, it may be incomplete.
243 This AST is governed by the ontological rules dictated in
245 and derives its terminology accordingly.
247 The AST is composed of
249 nodes with element, root and text types as declared by the
252 Each node also provides its parse point (the
257 fields), its position in the tree (the
263 fields) and some type-specific data.
265 The tree itself is arranged according to the following normal form,
266 where capitalised non-terminals represent nodes.
268 .Bl -tag -width "ELEMENTXX" -compact
272 \(<- ELEMENT | TEXT | BLOCK
285 The only elements capable of nesting other elements are those with
286 next-lint scope as documented in
289 The following example reads lines from stdin and parses them, operating
290 on the finished parse tree with
292 This example does not error-check nor free memory upon failure.
293 .Bd -literal -offset indent
296 struct man_node *node;
301 bzero(®s, sizeof(struct regset));
303 man = man_alloc(®s, NULL, 0, NULL);
307 while ((len = getline(&buf, &alloc_len, stdin)) >= 0) {
308 if (len && buflen[len - 1] = '\en')
309 buf[len - 1] = '\e0';
310 if ( ! man_parseln(man, line, buf))
311 errx(1, "man_parseln");
317 if ( ! man_endparse(man))
318 errx(1, "man_endparse");
319 if (NULL == (node = man_node(man)))
328 in the source archive for a rigorous reference.
335 library was written by
336 .An Kristaps Dzonsons Aq kristaps@bsd.lv .