Talk:Transformation language
| This is the talk page for discussing improvements to the Transformation language article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
[untitled]
editSugestion: merge article Data transformation here. --Krauss (talk) 11:09, 8 March 2011 (UTC)
Other types of transformational languages
editWhy is this only about text transformational languages. As an example the TREE-META unparse transformation rules. They transform a tree structure into sequential instruction code.
A lexer transform a string into tokens. A parser transforms token lists into a tree structure.
Many transformational languages have a form of pattern and action rule structure:
<pattern> -> <action>
or
<pattern> -> <replacement>
Some use imbeaded actions. TREE-META's syntax rules transform input into tree structures.
EXPR = TERM $(('+':ADD/'-':SUB) TERM [2]);
TERM = FACTOR $(('*':MPY/'/':DIV) FACTOR [2]);
FACTOR = .ID / .NUMBER / '(' EXPR ')';
The above rules recognize an arithmetic expression in text form and transform it into an abstract syntax tree:
a*(b+c) >> MPY[a,ADD[b,c]]
MPY
/ \
a ADD
/ \
b c
The unparse rules are of the form:
<tree pattern> -> <action>
Chomsky grammars are an example of the pattern replacement type. Steamerandy (talk) 12:40, 11 November 2015 (UTC)
Distinction between Transformation language and Program transformation
editNot well sourced and not well defined.
They were stubs for many years, I don't think anyone would improve them, if we weren't able to find sources to improve them.
Should we merge
... and possibly Rewriting]? Ushkin N (talk) 07:51, 31 July 2016 (UTC)