The validation of SGML content models

Mathematical and Computer Modelling

Volumn 25, Issue 4, 1997, Pages 73-84

  Bruggemann Klein A ^a   Wood, D ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Ambiguity; Conformance; Content model; Regular expressions; SGML

Indexed keywords

COMPUTATIONAL GRAMMARS; DATA STRUCTURES; STANDARDS;

CONTENT MODEL; STANDARD GENERALIZED MARKUP LANGUAGE (SGML);

CONTEXT FREE LANGUAGES;

EID: 0343990720     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00025-3     Document Type: Article

References (27)

1. J. Nievergelt, G. Coray, J.-D. Nicoud and A.C. Shaw, Document Preparation Systems, North-Holland, Amsterdam, (1982).
2. ISO 8879: Information processing - Text and office systems - Standard Generalized Markup Language (SGML), International Organization for Standardization, (October 1986).
3. R.W. Matzen, K.M. George and G.E. Hedrick, A model for studying ambiguity in SGML element declarations, In Proceedings of the ACM Symposium for Applied Computing, (1993).
4. J. Warmer and S. Townsend, The implementation of the Amsterdam SGML parser, Electronic Publishing -Origination, Dissemination and Design 2, 65-90, (1989).
5. J. Warmer and H. van Vliet, Processing SGML documents, Electronic Publishing - Origination, Dissemination and Design 4 (1), 3-26, (March 1991).
6. S. Ginsburg and M.M. Harrison, Bracketed context-free languages, Journal of Computer and System Sciences 1 (1), 1-23, (March 1967).
7. K. Thompson, Regular expression search algorithm, Communications of the ACM 11 (6), 419-422, (1968).
8. A.V. Aho, R. Sethi and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA, (1986).
9. B.W. Watson, A taxonomy of finite automata construction algorithms, Computing Science Notes 93/44, Eindhoven University of Technology, (December 1993).
10. F.C. Hennie, Finite-State Models for Logical Machines, John Wiley & Sons, New York, (1968).
11. R. Book, S. Even, S. Greibach and G. Ott, Ambiguity in graphs and expressions, IEEE Transactions on Computers C-20 (2), 149-153, (February 1971).
12. G. Berry and R. Sethi, From regular expressions to deterministic automata, Theoretical Computer Science 48, 117-126, (1986).
13. S. Sippu and E. Soisalon-Soininen, Languages and Parsing, Volume 1: Parting Theory, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, (1988).
14. V.M. Glushkov, The abstract theory of automata, Russian Mathematical Surveys 16, 1-53, (1961).
15. R. McNaughton and H. Yamada, Regular expressions and state graphs for automata, IRE Transactions on Electronic Computers EC-9 (1), 39-47, (March 1960).
16. B.G. Mirkin, An algorithm for constructing a base in a language of regular expressions, Engineering Cybernetics 5, 110-116, (1966).
17. E. Leiss, The complexity of restricted regular expressions and the synthesis problem of finite automata, Journal of Computer and System Sciences 23 (3), 348-354, (December 1981).
18. J.-M. Champarnaud, From a regular expression to an automaton, Information Processing Letters (to appear).
19. J.A. Brzozowski, Derivatives of regular expressions, Journal of the ACM 11 (4), 481-494, (October 1964).
20. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA, (1979).
21. J. Albert and Th. Ottmann, Automaten, Sprachen und Maschinen, Bibliographisches Institut, Mannheim, (1983).
22. D. Wood, Theory of Computation, John Wiley & Sons, New York, (1987).
23. A. Brüggemann-Klein, Formal models in document processing, Habilitationsschrift. Faculty of Mathematics, University of Freiburg, (1993).
24. A. Brüggemann-Klein, Compiler-construction tools and techniques for SGML parsers: Difficulties and solutions, Electronic Publishing - Organization, Dissemination, and Design (to appear).
25. J. Clark, Source code for SGMLS. Available by anonymous ftp from ftp.uu.net and sgml1.ex.ac.uk, (1992).
26. A. Brüggemann-Klein, Regular expressions into finite automata, Theoretical Computer Science 120, 197-213, (1993).
27. A. Brüggemann-Klein and D. Wood, One-unambiguous regular languages, Information and Computation (to appear).