[Uzrname]

Originally Posted by DjNDB

It can be expressed in BNF as:

<Wine> ::= <Wine> 'Is Not an Emulator'

Or in Java as:

public String Wine() {
return Wine() + "Is Not an Emulator";
}

If you learn about recursive functions for the first time that usually leaves a certain impression. Look at a classic example, Fibonacci.

long fib(unsigned long n) {
    if (n <= 1) {
        return n;
    } else {
        return fib(n-1)+fib(n-2);
    }
}

You write a function by using the function you are currently writing as if it was already working, which might seem kind of absurd if you're new to it.
Recursive acronyms probably don't make more sense to you now, but at least i got you to read this geek stuff.

Err... you lost me at BNF.