No this in not forth-like (i.e. referring to the programming language Forth, see also reverse polish notation [1-2]), as in Forth operands precede operations:
"the moon green cheese is john believes john wrong is mary thinks."
Note that this almost exactly corresponds to japanese grammar (which really feels very forth-like)
tsukisama ha midori no chi-zu da to john ga shinjite, machigatte to mary ga omotte to john ga itta.
An interesting resulting property of japanese grammar is that attributive phrases are grammatically equivalent to recursive sentences. I.e. "aoi sora" meaning "blue sky" is gramatically the same as "the sky, which is blue". (as "aoi" = "blue" is a fully valid single-word sentence in japanese grammar)
What you refer to is Lisp-like grammar. But in Lisp you have parentheses that help with making the grouping explicit. Maybe Lisp without parentheses is more difficult to understand than reverse polish notation because the "stack" needed to parse the sentence needs to be build by reading the sentence in reverse.
Seems forth-like, requiring a stack to be understood.
If a language requires recursion to process it, is that language "recursive" despite not possessing explicit recursive syntax?