In [1]:

#WRT https://github.com/JuliaLang/julia/issues/5571#issuecomment-157608127

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

In [2]:

function terse_lambda(l_args::Vector{Symbol}, new_ff::Expr)    
    if length(l_args)==0
        return new_ff      
    elseif length(l_args)==1
        Expr(:->,
            l_args[1],
            new_ff
        )
    else
        Expr(:->,
            Expr(:tuple,l_args...),
            new_ff
        )
    end
end

Out[2]:

terse_lambda (generic function with 1 method)

In [3]:

function terse_treechange(ff::Expr)
    #Need to search the tree from left most node, to right
    #This is depth first I think (CHKLOGIC)
    function rec(path::Vector{Int},gg::Expr)
        new_tail = Any[]
        l_args = Symbol[]
        
        for (child_ii, hh) in enumerate(gg.args)
            if typeof(hh)==Expr
                c_path=[path...,child_ii]
                new_hh, c_l_args = rec(c_path,hh)
                if length(c_l_args)>0
                    push!(l_args, c_l_args...)
                end
                push!(new_tail, new_hh)
            elseif hh==:_
                path_str = join(path,"b")
                #There may be a way to use the existing hygine mechnanism's to avoid a nameclash here
                #For now I describe them with the path
                c_l_arg = Symbol("xx$(path_str)t$(child_ii)")
                
                push!(l_args, c_l_arg)
                push!(new_tail, c_l_arg)
            else
                push!(new_tail, hh)
            end
        end
        new_gg = Expr(gg.head, new_tail...)
        (new_gg, l_args)
    end
    new_ff, ol_args = rec(Int[], ff)
    terse_lambda(ol_args, new_ff)
end

Out[3]:

terse_treechange (generic function with 1 method)

In [4]:

function terse!(ff)
    ff
end
function terse!(ff::Expr)
    const prec_other = Set(map(Symbol,["->", "if"]))
    const prec_assignment = Set(map(Symbol,["=", ":=", "+=", "-=", "*=", "/=", "//=", ".//=", ".*=", "./=", "|\\=|", "|.\\=|", "^=", ".^=", "÷=", ".÷=", "%=", ".%=", "|\|=|", "&=", "\$=", "=>", "<<=", ">>=", ">>>=", "~", "|.+=|", "|.-=|"]))
    const prec_conditional = Set([:?])
    const prec_arrow = Set(map(Symbol,["", "'(--", "-->", "←", "→", "↔", "↚", "↛", "↠", "↣", "↦", "↮", "⇎", "⇏", "⇒", "⇔", "⇴", "⇶", "⇷", "⇸", "⇹", "⇺", "⇻", "⇼", "⇽", "⇾", "⇿", "⟵", "⟶", "⟷", "⟷", "⟹", "⟺", "⟻", "⟼", "⟽", "⟾", "⟿", "⤀", "⤁", "⤂", "⤃", "⤄", "⤅", "⤆", "⤇", "⤌", "⤍", "⤎", "⤏", "⤐", "⤑", "⤔", "⤕", "⤖", "⤗", "⤘", "⤝", "⤞", "⤟", "⤠", "⥄", "⥅", "⥆", "⥇", "⥈", "⥊", "⥋", "⥎", "⥐", "⥒", "⥓", "⥖", "⥗", "⥚", "⥛", "⥞", "⥟", "⥢", "⥤", "⥦", "⥧", "⥨", "⥩", "⥪", "⥫", "⥬", "⥭", "⥰", "⧴", "⬱", "⬰", "⬲", "⬳", "⬴", "⬵", "⬶", "⬷", "⬸", "⬹", "⬺", "⬻", "⬼", "⬽", "⬾", "⬿", "⭀", "⭁", "⭂", "⭃", "⭄", "⭇", "⭈", "⭉", "⭊", "⭋", "⭌", "￩", "￫))"]))
    const prec_above = union(prec_other, prec_assignment,prec_conditional, prec_arrow)

    function high_prec_node(gg::Expr)
        gg.head in prec_above
    end
    
    const prec_below = Set([:*,:+,:-,:/,:÷]) #Their many be others
    function low_prec_node(gg::Expr)
        #Certain nodes should not be transformed inside of, even if they are the top node
        gg.head == :call && gg.args[1] in prec_below
    end
    
    #######################
    
    rewrite_nodes = Expr[]
    
    
    function need_rewrite!(gg)
        gg==:_ #My parent is a rewrite candiated if I am a blank node
    end
    
    function need_rewrite!(gg::Expr, top=false)
        at_peak = ((top && !low_prec_node(gg))  #Don't internally change within low_prec_node, even if at top
                    || high_prec_node(gg)) #Do internally change with nodes of precences to high to propergate upwards
        
        need_rewrite_at_parent = false
        for child in gg.args
            child_need_rewrite = need_rewrite!(child)
            this_child_demand_granparent_rewrite = child_need_rewrite && ((at_peak && child==:_) || !at_peak)
            if this_child_demand_granparent_rewrite
                need_rewrite_at_parent=true
                break
            end
        end
        
        if need_rewrite_at_parent 
            return true
        end
        
        #I can be rewritten as I am not demanding my parents be rewritten
        for ii in 1:length(gg.args)
            child = gg.args[ii]
            child_need_rewrite = need_rewrite!(child)
            if child_need_rewrite && at_peak
                gg.args[ii]=terse_treechange(child)
            end
        end
        
        return false
    end
    
    rewrite_top = need_rewrite!(ff,true)
    #println(rewrite_top)
    if rewrite_top
        terse_treechange(ff)
    else
        ff
    end
end

Out[4]:

terse! (generic function with 2 methods)

In [5]:

macro terse(ff)
    terse!(ff)
end

In [ ]:

In [6]:

#Failing,
#I'm not sure this failure is not infact the prefered behavour

In [7]:

:(_ ? "true" : "false") |> terse! #→ (x -> x) ? "true" : "false")

Out[7]:

:(xxt1->if xxt1
            "true"
        else 
            "false"
        end)

In [8]:

:(_ ? _ : 0) |> terse!  #→ (x -> x) ? (y -> y) : 0

Out[8]:

:((xxt1,xxt2)->if xxt1
            xxt2
        else 
            0
        end)

In [ ]:

In [9]:

#Failing, Can't Fix
#As (_) is interpretted as the same as _

In [10]:

:(map((_), v)) |> terse! #→ map(x -> x, v)

Out[10]:

:(xxt2->map(xxt2,v))

In [ ]:

In [11]:

#Won't Fix
#Only standalone _ are broken, iuf they form part of even a simple expression eg `1_` they work
#code only expressions are being rewritten, not symbols

In [12]:

:(_)|>terse!           #→ x -> x

Out[12]:

:_

In [13]:

:(f = _)|>terse!       #→ f = x -> x

Out[13]:

:(xxt2->f = xxt2)

In [14]:

#Passing

In [15]:

terse!(:(map(_ + 2, v) ))

Out[15]:

:(map((xxt2->xxt2 + 2),v))

In [16]:

terse!(:(_ + 2))

Out[16]:

:(xxt2->xxt2 + 2)

In [17]:

terse!(:(f=_+2) )

Out[17]:

:(f = (xxt2->xxt2 + 2))

In [18]:

terse!(:(x->_+2) )

Out[18]:

:(x->(xx2t2->begin  # In[18], line 1:
                xx2t2 + 2
            end))

In [19]:

terse!(:(map(_ + 2, v) ))

Out[19]:

:(map((xxt2->xxt2 + 2),v))

In [20]:

terse!(:(f(_,b)))

Out[20]:

:(xxt2->f(xxt2,b))

In [21]:

terse!(:(f(a,_)))

Out[21]:

:(xxt3->f(a,xxt3))

In [22]:

terse!(:(f(_,_)))

Out[22]:

:((xxt2,xxt3)->f(xxt2,xxt3))

In [23]:

terse!(:(2_^2))

Out[23]:

:(xx3t2->2 * xx3t2 ^ 2)

In [24]:

terse!(:(2_^_))

Out[24]:

:((xx3t2,xx3t3)->2 * xx3t2 ^ xx3t3)

In [25]:

terse!(:(map(2_ + 2, v)))

Out[25]:

:(map((xx2t3->2xx2t3 + 2),v))

In [26]:

terse!(:(map(abs,_)))

Out[26]:

:(xxt3->map(abs,xxt3))

In [27]:

terse!(:(map(2_ + 2, _)))

Out[27]:

:((xx2b2t3,xxt3)->map(2xx2b2t3 + 2,xxt3))

In [28]:

terse!(:(a[_]))

Out[28]:

:(xxt2->a[xxt2])

In [29]:

terse!(:(a[_,_]))

Out[29]:

:((xxt2,xxt3)->a[xxt2,xxt3])

In [30]:

terse!(:(a[_,1_]))

Out[30]:

:((xxt2,xx3t3)->a[xxt2,1xx3t3])

In [31]:

:(f(_,2_)) |> terse!

Out[31]:

:((xxt2,xx3t3)->f(xxt2,2xx3t3))

In [32]:

:(map(2_ + 2, _)) |> terse! #→ x -> map(y -> 2y + 2, x)

Out[32]:

:((xx2b2t3,xxt3)->map(2xx2b2t3 + 2,xxt3))

In [33]:

:(map(2_ - _, v, w)) |> terse! #→ map((x, y) -> 2x - y, v, w)

Out[33]:

:(map(((xx2t3,xxt3)->2xx2t3 - xxt3),v,w))

In [34]:

:(map(2_ - _, v, _)) |> terse! #→ x -> map((y, z) -> 2y - z, v, x)

Out[34]:

:((xx2b2t3,xx2t3,xxt4)->map(2xx2b2t3 - xx2t3,v,xxt4))

In [35]:

:(map(2_ - _, _, _)) |> terse! #→ (x, y) -> map((z, w) -> 2z - w, x, y)

Out[35]:

:((xx2b2t3,xx2t3,xxt3,xxt4)->map(2xx2b2t3 - xx2t3,xxt3,xxt4))

In [36]:

:(map(_, v))|>terse!    #→ x -> map(x, v)

Out[36]:

:(xxt2->map(xxt2,v))

In [37]:

:(f = 2_)|>terse!      #→ f = x -> 2x

Out[37]:

:(f = (xxt3->2xxt3))

In [38]:

:(x -> x^_)|>terse!    #→ x -> y -> x^y

Out[38]:

:(x->(xx2t3->begin  # In[38], line 1:
                x ^ xx2t3
            end))

In [39]:

:(_ && _)|>terse!      #→ (x, y) -> x && y

Out[39]:

:((xxt1,xxt2)->xxt1 && xxt2)

In [40]:

:(!_ && _)|>terse!    #→ (x, y) -> !x && y

Out[40]:

:((xx1t2,xxt2)->!xx1t2 && xxt2)

In [41]:

:(2v[_])|> terse! #→ x -> 2v[x] (good)

Out[41]:

:(xx3t2->2 * v[xx3t2])

In [42]:

:(2f(_)) |> terse! #→ 2*(x -> f(x)) (not so good)

Out[42]:

:(xx3t2->2 * f(xx3t2))

In [ ]: