Revision as of 11:15, 9 March 2025 edit Utibe Noah Silas (talk \| contribs) Extended confirmed users 3,208 edits I made copyedits ← Previous edit		Latest revision as of 10:27, 10 April 2025 edit undo 147.32.71.7 (talk) →Transformational languages: This paragraph was been questioned since 2007, yet no clarifications or references
Line 96: In other words, all instances of a function invocation of foo with three arguments, followed by a function invocation with two arguments would be replaced with a single function invocation using some or all of the original set of arguments. Another advantage to using regular expressions is that they will not fail the null transform test. That is, using your transformational language of choice, run a sample program through a transformation that doesn't perform any transformations. Many transformational languages will fail this test. ==See also==

Data transformation (computing): Difference between revisions