Recursive resumable functions vs PyGen vs Python generator about resumablefunctions.jl

[BenLauwens]

Hi

With 3 minor modifications I can reproduce what you want:

using ResumableFunctions

@resumable function g(x)
    if isa(x,Number)
        return x # If x is a number the @resumable function is only called once
    else
        for i in x
            for j in g(i)
                j == nothing || @yield j # No explicit return is defined, so we have to eliminate the default returns
            end
        end
    end
end

a = [[1,2,3],[4,5,6]]

for i in g(a)
    i==nothing || println(i) # Eliminate the default return
end

A @resumable function will stop when a return is encountered or when the function hits the final end statement. This is also the default behaviour in C# and is a logical consequence of the finite-state-machine implementation using macros. The magic in Python is possible because the compiler can remove the default returns. In PyGen it is also the compiler that handles the tasks, the context switching and the channels which are more expensive than simple function calls as used in ResumableFunctions.
FYI PyGen for Julia v0.5 base on the deprecated produce and consume functions has the same problem with your example.
To eliminate the default nothing return you have to return explicitly the last value:

using ResumableFunctions

@resumable function fibonnaci(n::Int)
  a = 0
  b = 1
  for i in 1:n-1
    @yield a
    a, b = b, a+b
  end
  a
end

for fib in fibonnaci(10)
  println(fib)
end