Hedge Pattern Partial Derivative

@inproceedings{Suzuki2009HedgePP,
  title={Hedge Pattern Partial Derivative},
  author={Taro Suzuki and Satoshi Okui},
  booktitle={CIAA},
  year={2009}
}
We propose hedge pattern partial derivatives, an extension of Antimirov's partial derivatives, in order to give an operational semantics of pattern matching of regular hedge expression patterns, which is crucial in XML processing. We show that correct and small matching automata can be constructed from hedge pattern partial derivatives. 
1 Citations
Construction of tree automata from regular expressions
TLDR
This work transfers Antimirov's partial derivatives from regular word expressions to regular tree expressions for an analysis of the size of the resulting automaton as well as for algorithmic improvements.

References

SHOWING 1-10 OF 17 REFERENCES
Type inference for unique pattern matching
TLDR
The generally accepted method of defining the longest match in terms of the first match and recursion does not conform to the natural notion of longest match, so the type inference problem for both disambiguation strategies is solved, which consists of calculating the set of all subparts of input values a subexpression can match under the given policy.
Compiling regular patterns to sequential machines
  • B. Emir
  • Computer Science
    SAC '05
  • 2005
TLDR
It is shown that regular pattern matching corresponds to sequential transduction, and straightforward ways to optimally compile regular patterns to sequential machines are derived to decide when regular patterns are unambiguous.
XDuce: A Typed XML Processing Language (Preliminary Report)
TLDR
The authors need to go beyond types for documents and exploit type information in static checking of programs for XML processing to make the best use of static typing mechanisms.
CDuce: an XML-centric general-purpose language
TLDR
This work presents the functional language CDuce, discusses some design issues, and shows its adequacy for working with XML documents, including a dispatch algorithm that demonstrates how static type information can be used to obtain very efficient compilation schemas.
Construction of Tree Automata from Regular Expressions
TLDR
This work transfers Antimirov's partial derivatives from regular word expressions to regular tree expressions for an analysis of the size of the resulting automaton and the methods of Champarnaud and Ziadi from words to trees.
Derivatives of Regular Expressions
TLDR
In this paper the notion of a derivative of a regular expression is introduced atld the properties of derivatives are discussed and this leads, in a very natural way, to the construction of a state diagram from a regularexpression containing any number of logical operators.
XQuery 1.0 : An XML Query Language
XML is a versatile markup language, capable of labeling the information content of diverse data sources including structured and semi-structured documents, relational databases, and object
XML Goes Native: Run-Time Representations for Xtatic
TLDR
This work analyzes representation choices for XML tags, trees, and textual data that use memory efficiently, support efficient pattern matching, allow maximal sharing of common substructures, and permit separate compilation by the Xtatic compiler.
From Regular Expressions to Deterministic Automata
...
1
2
...