Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton

Authors Jan Janousek, Jaroslav Málek

Thumbnail PDF


  • Filesize: 0.57 MB
  • 7 pages

Document Identifiers

Author Details

Jan Janousek
Jaroslav Málek

Cite AsGet BibTex

Jan Janousek and Jaroslav Málek. Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton. In 3rd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 38, pp. 159-165, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


A new and simple method for target code selection by tilling an abstract syntax tree is presented. As it is usual, tree patterns corresponding to target machine instructions are matched in the abstract syntax tree. Matching tree patterns is performed with the use of tree pattern pushdown automaton, which accepts all tree patterns matching the abstract syntax tree in the linear postfix bar notation and represents a full index of the abstract syntax tree for tree patterns. The use of the index allows to match patterns quickly, in time depending on the size of patterns and not depending on the size of the tree. The selection of a particular target instruction corresponds to a modification of the abstract syntax tree and also a corresponding incremental modification of the index is performed. A reference to a fully functional prototype is provided.
  • code generation
  • abstract syntax tree
  • indexing
  • tree pattern matching
  • pushdown automata


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail