| |
| | SGML: Simplification & disambiguation revisited |
 | | The rules are valuable if you are designing an SGML based system (e.g., an editor, or a database engine), and if you want to be sure that any unit (data, or element) in content may be connected to a single, immutable token in the content model. |
 | | A+ - A+ and-reduction rules 1 A and A - (A, A) 2 A? and A y (A, A?) 3 A* and A y (A, A*) 4 A+ and A y (A, A+) 5 A+ and A+ - (A, A+) pcdata reduction rules (p = pcdata) 1 p, p - p 2 p |
 | | 1 a is unambiguous 2 A? is unambiguous iff A is unambiguous 3 A+ and A* are unambiguous iff 3.1 A is unambiguous 3.2 for all a in ((A first) intersect (A last)) holds that a is required in (A last) (i.e. |
| www.oasis-open.org /cover/loefTabl.html (648 words) |
|