Fibonacci Sequence - Groovy Typing CST Test
Loading…
Fibonacci Sequence — Groovy Code
Generate Fibonacci numbers recursively.
def fibonacci
fibonacci = { n ->
if (n == 0) return 0
if (n == 1) return 1
return fibonacci(n-1) + fibonacci(n-2)
}
(0..9).each { println fibonacci(it) }Groovy Language Guide
Groovy is a powerful, dynamic JVM language that integrates seamlessly with Java, offering concise syntax, scripting capabilities, functional programming patterns, and strong support for automation, DSL creation, and Gradle build scripts. It blends Java familiarity with Python/Ruby-like expressiveness.
Primary Use Cases
- ▸Gradle build scripts
- ▸Jenkins declarative & scripted pipelines
- ▸Automation & scripting on the JVM
- ▸Rapid backend prototyping
- ▸Testing frameworks (Spock)
- ▸Domain-specific language (DSL) creation
Notable Features
- ▸Java interoperability
- ▸Closures & functional constructs
- ▸Dynamic + optional static typing
- ▸Simplified syntax
- ▸Metaprogramming & AST transformations
Origin & Creator
Created by James Strachan in 2003; later developed under the Apache Software Foundation.
Industrial Note
Groovy is foundational to Gradle and Jenkins pipelines. It dominates CI/CD automation, DevOps pipelines, JVM scripting, and domain-specific language (DSL) development across enterprises.