A theoretical foundation of the DSSSL location model

Authors:
M. Murata;H. Nakatsuyama
Affiliations:
Fuji Xerox Information Systems, KSP 9A7, 2-1 Sakado 3-chome, Takatsu-ku, Kawasaki-shi Kanagawa-Ken 213, Japan;Systems and Communications Lab., Fuji Xerox Co., Ltd. 430 Sakai, Nakai-machi, Ashigarakami-gun, Kanagawa, 259-01 Japan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 5
Cited 0

A logical query language for hypertext systems

Hypertext: concepts, systems and applications
Hyperdocuments as automata: trace-based browsing property verification

ECHT '92 Proceedings of the ACM conference on Hypertext
Regular right-part attribute grammars

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Tree Tranformations, Functional Languages, and Attribute Grammars

Proceedings of the International Conference WAGA on Attribute Grammars and their Applications
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop

Quantified Score

Hi-index	0.98

Visualization

Abstract

In the location model of Document Style Semantics and Specification Language (DSSSL), one can use tree patterns to locate nodes in logical structures of documents. A tree pattern consists of conditions on nodes and those on their hierarchical relationships. As a first step towards efficient implementations, this paper shows a theoretical foundation of the location model. Tree patterns are first expressed by sentences of branching-time temporal logic. These sentences are then converted to well-formed attribute grammars. Thus, the library of attribute grammar evaluation techniques can be used to implement the location model. It is our belief that this observation is significant for future implementors of DSSSL. Furthermore, the converted attribute grammars can be evaluated by traversing logical structures several times. The number of required traversals can be found by examining the original sentences.