Attribute grammars for unranked trees as a query language for structured documents

DOI10.1016/J.JCSS.2004.10.008MaRDI QIDQ1776378zbMATH OpenOpenAlexFDO

Authors Frank Neven

Publication date 12 May 2005

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2004.10.008

zbMATH Keywords

Attribute grammarsComplexityExpressivenessMonadic second-order logicUnranked treesXML

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2080403
• Expressiveness of structured document query languages based on attribute grammars
• scientific article; zbMATH DE number 1950751
• Query automata over finite trees
• scientific article; zbMATH DE number 1759405

Cites work

• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• A Grammar-Based Approach Towards Unifying Hierarchical Data Models
• Algebras for querying text regions: Expressive power and optimization
• Ambiguity in Graphs and Expressions
• Attribute grammars. Definitions, systems and bibliography
• Complexity results for two-way and multi-pebble automata and their logics
• Composition and evaluation of attribute coupled grammars
• Computer science today. Recent trends and developments
• Deciding Equivalence of Finite Tree Automata
• Domains of partial attributed tree transducers
• Définition et etude des Bilangages réguliers
• Expressiveness of structured document query languages based on attribute grammars
• Generalizations of regular sets and their application to a study of context-free languages
• scientific article; zbMATH DE number 176242 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1086493 (Why is no real title available?)
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• scientific article; zbMATH DE number 2080402 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Normal form algorithms for extended context-free grammars
• One-unambiguous regular languages
• Query automata over finite trees
• Semantics of context-free languages
• The intrinsically exponential complexity of the circularity problem for attribute grammars
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(8)

• Formal properties of XML grammars and languages
• Deciding twig-definability of node selecting tree automata
• Expressiveness of structured document query languages based on attribute grammars
• Translation of tree-processing programs into stream-processing programs based on ordered linear type
• scientific article; zbMATH DE number 2080403 (Why is no real title available?)
• On the complexity of regular-grammars with integer attributes
• Optimizing the region algebra is PSPACE-complete
• Automata for XML -- a survey

This page was built for publication: Attribute grammars for unranked trees as a query language for structured documents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776378)