Whilst trying (and failing) have persuade my infant son to eat his dinner, I tried singing to him. Mid way through this song I realised the formulaic structure might lend itself well to code golfing!

The task is to write a program or function which accepts no input and produces the following text:

There's a hole in the bottom of the sea
There's a hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a log in the hole in the bottom of the sea
There's a log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a bump on the log in the hole in the bottom of the sea
There's a bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a frog on the bump on the log in the hole in the bottom of the sea
There's a frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a flea on the fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a flea on the fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

There's a smile on the flea on the fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a smile on the flea on the fly on the hair on the wart on the frog on the bump on the log in the hole in the bottom of the sea
There's a hole, there's a hole
There's a hole in the bottom of the sea

Challenge rules:

The text may be printed or returned as function output
Each verse is separated by a single empty line
Trailing whitespace is OK as long as it does not change the layout (so no leading whitespace or extra spaces between words)
Trailing newlines are OK too.
No leading newlines.
All languages welcomed, and this is code-golf, so the shortest answer in bytes for each language wins!

Sok

Posted 2019-01-30T14:46:13.853

Reputation: 5 592

Similar to There Was an Old Lady (other similar challenges e.g. this have been closed as duplicates, although I don't think they necessarily should.)

– Jonathan Allan – 2019-01-30T16:33:09.583

6Ho, ro, the rattlin' bog, the bog down in the valley-o. – fəˈnɛtɪk – 2019-01-30T22:22:57.310

4For comparison (though not a programming language) gzip -5 compresses it to 186 bytes (and bzip2 and xz seem to do worse). – Daniel Schepler – 2019-01-30T23:34:48.513

@DanielSchepler Bubblegum :P – ASCII-only – 2019-01-31T03:13:40.260

2Congrats, from another developer parent :) – AJFaraday – 2019-01-31T14:26:37.583

1I want to adapt this song to 05AB1E... "There's a hole in oh-five-ay-bee-one-ee!" – Magic Octopus Urn – 2019-01-31T16:40:35.783

As KC string compression challenges go, I've had more fun with this one than most others in a while so +1 from me. – Shaggy – 2019-02-01T00:06:16.200

@Shaggy Thanks for the lovely comment, I'm glad to have given you something fun to think about :o) – Sok – 2019-02-01T06:23:00.500

Next time use Maxwell's poem: 2(u) (Under the Sea, Under the Sea)

– Mazura – 2019-02-02T02:23:57.580

Answers

SOGL, 103 94 93 bytes

Ψ ~Δ№Q‘η¦»vζh‛←&M⁶╥7[P≈╔6≡⁸(φΔ\⅔Σ‚>≡ā⁷⁽○¹‘Ξ⁵K4s³‘⁽Bθ2n{@∑" the ”+Κ:bΚē‽:C}TPb"n@²‘+Tō, upcPøP

Try it here!

...‘                 push "bottom of the sea" - kept for the loop, here for 
    ...‘             push "hole in log in bump on frog on wart on hair on fly on flea on smile on"
        ...‘         push "there's a "
            ⁽        uppercase the 1st letter of that
             B       save "There's a " in B
              θ      split the long data string on spaces
               2n    split in arrays of length 2

{                     for each of those:
 @∑                   join the current array with spaces - e.g. "hole in"
   " the ”+           append " the " to it
           Κ          prepend that to "bottom of the sea" (or whatever it is now)
            :         create a copy
             bΚ       prepend B to it - finishes current line
               ē‽:C}  if (E++), save a copy of that in C (for the last line)

TP                   print the current line twice
  b"...‘+            B + "hole" - "There's a hole"
         T           output that, keeping item
          ō,         output ", "
             up      print the kept item lowercased
               cP    print the contents of C
                 øP  print an empty line

dzaima

Posted 2019-01-30T14:46:13.853

Reputation: 19 048

14But....but how? – SomeShinyObject – 2019-01-31T04:06:08.697

8Incredible. How even-- – Austin Burk – 2019-01-31T05:04:51.640

1HNQ strikes again! :\ – Shaggy – 2019-02-01T01:30:02.163

4Would you mind adding an explanation? Curious to see how it works. – Kevin Cruijssen – 2019-02-01T08:18:30.243

@KevinCruijssen added – dzaima – 2019-02-01T15:20:53.783

Stax, 90 87 75 bytes

¥▌▼h4█☻■Ω1gçΔ¶Zjµ│☺X▄)/╞▄╒)¥jêLqα╧ñu┌⌂½╧ûⁿ↕O◘╔╪kl<æàbπïfuσ♪╫qΓ╪ûQ├╘Te♥Æó♣ƒE

Run and debug it

Unpacked, ungolfed, and commented it looks like this.

`;$w]i"50h1&V~OP>F$`            compressed literal for "There's a hole in the bottom of the sea"
X                               store in register X without popping
zG                              push an empty string and jump to the target (trailing }) 
`hfUiVx}.|j~vG12])Bxk?v zF`j    split "log bump frog wart hair fly flea smile" into array of words
F                               for each word, execute the following
  i. o. i?                      (i ? " o" : " i") where i is the 0-based iteration index
  +                             concatenate to the word
  `_o9!`+                       concatenate "n the "
  G                             jump to target below, resume next foreach iteration when finished
}                               this is the target of `G`, execution resumes when finished
  As|@                          insert substring at position 10
  QQ                            peek and print with newlines twice
  x14(                          trim string to leftmost 14 characters
  q                             peek and print without newlines
  ., p                          print ", " without newline
  vP                            lowercase 14 characters and print with newline
  xP                            push value of register X, then print with newline
  zP                            print blank line

Run this one

recursive

Posted 2019-01-30T14:46:13.853

Reputation: 8 616

2Would you mind adding an explanation? Curious to see how it works. – Kevin Cruijssen – 2019-02-01T08:18:32.310

I will but I still have the feeling that a totally different approach will do better. After I succeed or fail in that I'll explain whatever's left. – recursive – 2019-02-01T15:50:47.620

1@KevinCruijssen: I had a feeling that that there was a much better approach. Sure enough, I totally re-wrote it, and saved another 12 bytes of bloat. I added some explanation as well. – recursive – 2019-02-05T04:00:27.910

Perl 5, 158 154 bytes

$_="There's a bottom of the sea
";for$,(<{{hole,log}" i",{bump,frog,wart,hair,fly,flea,smile}" o"}>){s/a/a $,n the/;say$_.$_.($t||=s/.{14}/$&, \l$&
$&/r)}

154 bytes

158 bytes

Nahuel Fouilleul

Posted 2019-01-30T14:46:13.853

Reputation: 5 582

5There's a bottom of the sea. The facts check out, +1 – Jo King – 2019-01-31T13:33:53.067

:), there's also this variation starting with There's a sea but it's longer

– Nahuel Fouilleul – 2019-02-01T13:25:55.813

Python 2, 202 190 187 185 183 182 181 bytes

s="bottom of the sea\n"
a="There's a "
for w in'hole log bump frog wart hair fly flea smile'.split():s=w+" %sn the "%'io'['g'in s]+s;print(a+s)*2+a+"hole, t%shole\n"%a[1:]+a+s[-30:]

There's a hole in the bottom of the sea

Answers

SOGL, 103 94 93 bytes

Stax, 90 87 75 bytes

Perl 5, 158 154 bytes

Python 2, 202 190 187 185 183 182 181 bytes

C (gcc), 261 246 236 bytes

05AB1E, 103 100 99 97 96 93 92 bytes

PowerShell, 194 188 185 180 174 bytes

JavaScript (ES6), 201 194 189 188 187 bytes

JavaScript (ES6), 235 bytes

Bash, 168 160 bytes

Japt -Rx, 126 116 113 112 111 109 107 bytes

XML, 719 673 603 514 493 486 bytes

Retina 0.8.2, 150 bytes

R, 237 231 bytes

PHP, 180 178 bytes

C (gcc), 334 328 307 299 bytes

Japt -R, 142 bytes

Perl 6, 166 bytes

Ruby, 173 170 bytes

Haskell, 243 215 bytes

Batch, 267 bytes

JavaScript (Babel Node), 239 bytes

Python 3, 213 206 198 193 bytes

Clean, 267 bytes

Charcoal, 115 106 bytes

cQuents, 238 219 bytes

Explanation

Perl 5, 194 bytes

C# (Visual C# Interactive Compiler), 220 bytes

V, 184 170 bytes

Explanation:

///, 216 bytes

LaTeX, 265 268 characters

Shell, 291 bytes

C# (.NET Core), 315, 320, 290 bytes

Java (OpenJDK 8), 320 344 bytes

ink, 231 229 bytes

Japt `-Rx`, 126 116 113 112 111 109 107 bytes

Japt `-R`, 142 bytes