From regular expressions to deterministic automata
Theoretical Computer Science
The implementation of the Amsterdam SGML parser
Electronic Publishing—Origination, Dissemination, and Design
Electronic Publishing—Origination, Dissemination, and Design
A model for studying ambiguity in SGML element declarations
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Regular expressions into finite automata
Theoretical Computer Science
One-unambiguous regular languages
Information and Computation
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Ambiguity in Graphs and Expressions
IEEE Transactions on Computers
Bracketed context-free languages
Journal of Computer and System Sciences
SGML and XML document grammars and exceptions
Information and Computation
Generic validation of structural content with parametric modules
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Thompson Digraphs: A Characterization
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
A characterization of Thompson digraphs
Discrete Applied Mathematics
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 0.98 |
The Standard Generalized Markup Language (SGML) is an ISO standard that provides a syntactic meta-language for the definition of textual markup systems, which are used to indicate the structure of documents so that they can be electronically typeset, searched, and communicated. We address only one problem raised by the standard, namely: in SGML, the right-hand sides of context-free productions are regular expressions, called content models, that are restricted to be what the standard calls ''unambiguous'', but what is more appropriately called deterministic. We solve the problem of how to define determinism precisely, how to recognize deterministic regular expressions efficiently, and how to recognize deterministic regular languages. Any SGML parser must check that a given document grammar conforms to the standard; that is, it must validate it. Hence, our results are an important step in the clarification of the standard and in the efficient implementation of an SGML parser for SGML document grammars.