@inproceedings{Padovani05,
  volume = {3443},
  author = {Luca Padovani},
  series = {LNCS},
  booktitle = {Proceedings of the Compiler Construction (CC'05)},
  url = {http://www.di.unito.it/~padovani/Papers/lncs_3443.pdf},
  abstract = { Various techniques for the navigation and matching of data
              structures using path expressions have been the subject of
              extensive investigations. No matter whether such techniques are
              based on type information, indexing, automata, it is desirable to
              synthesize implementations automatically, starting from a
              high-level description of the path expressions to be traversed. In
              this paper we present a library of C++ templates for the
              representation of regular path expressions and their compilation
              into efficient backtracking algorithms. The resulting code can be
              used to implement visitors, pattern matchers, node collectors on
              regular paths over possibly heterogeneous, linked data structures.
              The point of the paper is on the path compilation technique, which
              was inspired by a continuation-passing, functional semantics of
              the path expressions. We rely on some peculiar aspects of C++
              templates to create a compilation framework that closely follows
              the given semantics. },
  title = {{Compilation of Generic Regular Path Expressions Using C++ Class
           Templates}},
  publisher = {Springer},
  year = {2005},
  pages = {27-42},
  doi = {10.1007/978-3-540-31985-6\_3},
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)