Please write me python code to get all Fibonacci numbers until 10 with a recursive function.
Certainly! 

Here's an example of how you can use a recursive function to generate Fibonacci numbers until a specified limit (`10` in this case) using Python:

```
def fibonacci(n):
    if n <= 1:
        return n
    else:
        return fibonacci(n-1) + fibonacci(n-2)

# Print all Fibonacci numbers until 10
for i in range(10):
    print(fibonacci(i))
```

This code defines a function called `fibonacci` that takes an argument `n` and returns the nth Fibonacci number using recursion. The function checks if `n` is less than or equal to 1 and returns n if that is the case, otherwise it calculates the sum of the two previous Fibonacci numbers (`fibonacci(n-1)` and `fibonacci(n-2)`) to get the current Fibonacci number.

To print all Fibonacci numbers until `10`, we use a for loop that iterates over the range `0` to `9`, calling the fibonacci function with each iteration and printing the result.
I dont like recursion, can you rewrite the code using a for loop ?