Caterpillars: A Context Specification Technique

Anne Brüggemann-Klein, D. Wood
{"title":"Caterpillars: A Context Specification Technique","authors":"Anne Brüggemann-Klein, D. Wood","doi":"10.1162/109966200750410613","DOIUrl":null,"url":null,"abstract":"We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciica-tion for structured documents, as we shall demonstrate, and for the speciication of computer program transformations. From a conceptual point of view, structured documents are trees, and one of the oldest and best-established techniques to process trees and, hence, structured documents are tree automata. We present a number of theoretical results that allow us to compare the expressive power of caterpillar expressions and caterpillar automata, their companions, to the expressive power of tree automata. In particular, we demonstrate that each caterpillar expression describes a regular tree language that is, hence, recognizable by a tree automaton. Finally, we employ caterpillar expressions for tree pattern matching. We demonstrate that caterpillar automata are able to solve tree-pattern-matching problems for some, but not all, types of tree inclusion that Kilpell ainen investigated in his PhD thesis. In simulating tree pattern matching with caterpillar automata, we reprove some of Kilpell ainen's results in a uniform framework. Earlier and shorter versions of some of the ideas in this paper were presented at PODDP '98 6] and at DLT '99 10].","PeriodicalId":447112,"journal":{"name":"Markup Lang.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Markup Lang.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1162/109966200750410613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 50

Abstract

We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciica-tion for structured documents, as we shall demonstrate, and for the speciication of computer program transformations. From a conceptual point of view, structured documents are trees, and one of the oldest and best-established techniques to process trees and, hence, structured documents are tree automata. We present a number of theoretical results that allow us to compare the expressive power of caterpillar expressions and caterpillar automata, their companions, to the expressive power of tree automata. In particular, we demonstrate that each caterpillar expression describes a regular tree language that is, hence, recognizable by a tree automaton. Finally, we employ caterpillar expressions for tree pattern matching. We demonstrate that caterpillar automata are able to solve tree-pattern-matching problems for some, but not all, types of tree inclusion that Kilpell ainen investigated in his PhD thesis. In simulating tree pattern matching with caterpillar automata, we reprove some of Kilpell ainen's results in a uniform framework. Earlier and shorter versions of some of the ideas in this paper were presented at PODDP '98 6] and at DLT '99 10].
毛毛虫:一种环境规范技术
我们提出了一种新颖而简单的技术来规范结构化文档中的上下文,我们称之为caterpillar表达式。虽然我们主要在HTML、SGML和XML文档的上下文相关样式表规范中应用此技术,但它也可以用于结构化文档的查询规范(我们将演示)和计算机程序转换规范。从概念的角度来看,结构化文档是树,处理树的最古老和最成熟的技术之一,因此结构化文档是树自动机。我们提出了一些理论结果,使我们能够将毛虫表达式和毛虫自动机(它们的同伴)的表达能力与树自动机的表达能力进行比较。特别是,我们证明了每个毛虫表达式描述了一种规则的树语言,因此可以被树自动机识别。最后,我们使用毛虫表达式进行树模式匹配。我们证明了履带式自动机能够解决Kilpell ainen在他的博士论文中研究的一些(但不是全部)树包含类型的树模式匹配问题。在用履带式自动机模拟树模式匹配时,我们用统一的框架对Kilpell ainen的一些结果进行了修正。本文中一些想法的早期和较短版本在PODDP[1998]和DLT[1999]上提出。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信