The Name Game: Difference between revisions
m (→{{header|Phix}}: added syntax colouring the hard way) |
|||
Line 1,588: | Line 1,588: | ||
print_verse(n) |
print_verse(n) |
||
end</lang> |
end</lang> |
||
=={{header|Nim}}== |
|||
<lang Nim>import strutils |
|||
const |
|||
StdFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" |
|||
WovelFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" |
|||
BFmt = "$1, $1, bo-$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" |
|||
FFmt = "$1, $1, bo-b$2\nBanana-fana fo-$2\nFee-fi-mo-m$2\n$1!" |
|||
MFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-$2\n$1!" |
|||
proc lyrics(name: string): string = |
|||
let tail = name[1..^1] |
|||
result = case name[0].toUpperAscii |
|||
of 'A', 'E', 'I', 'O', 'U', 'Y': |
|||
WovelFmt.format(name, name.toLowerAscii) |
|||
of 'B': |
|||
BFmt.format(name, tail) |
|||
of 'F': |
|||
FFmt.format(name, tail) |
|||
of 'M': |
|||
MFmt.format(name, tail) |
|||
else: |
|||
StdFmt.format(name, tail) |
|||
result = result.capitalizeAscii() |
|||
for name in ["Gary", "Earl", "Billy", "Felix", "Mary"]: |
|||
echo name.lyrics() |
|||
echo()</lang> |
|||
{{out}} |
|||
<pre>Gary, Gary, bo-bary |
|||
Banana-fana fo-fary |
|||
Fee-fi-mo-mary |
|||
Gary! |
|||
Earl, Earl, bo-bearl |
|||
Banana-fana fo-fearl |
|||
Fee-fi-mo-mearl |
|||
Earl! |
|||
Billy, Billy, bo-illy |
|||
Banana-fana fo-filly |
|||
Fee-fi-mo-milly |
|||
Billy! |
|||
Felix, Felix, bo-belix |
|||
Banana-fana fo-elix |
|||
Fee-fi-mo-melix |
|||
Felix! |
|||
Mary, Mary, bo-bary |
|||
Banana-fana fo-fary |
|||
Fee-fi-mo-ary |
|||
Mary!</pre> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |
Revision as of 14:09, 23 April 2021
You are encouraged to solve this task according to the task description, using any language you may know.
Write a program that accepts a name as input and outputs the lyrics to the Shirley Ellis song "The Name Game".
The regular verse
Unless your name begins with a vowel (A, E, I, O, U), 'B', 'F' or 'M' you don't have to care about special rules. The verse for the name 'Gary' would be like this:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary!
At the end of every line, the name gets repeated without the first letter: Gary becomes ary If we take (X) as the full name (Gary) and (Y) as the name without the first letter (ary) the verse would look like this:
(X), (X), bo-b(Y) Banana-fana fo-f(Y) Fee-fi-mo-m(Y) (X)!
Vowel as first letter of the name
If you have a vowel as the first letter of your name (e.g. Earl) you do not truncate the name. The verse looks like this:
Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl!
'B', 'F' or 'M' as first letter of the name
In case of a 'B', an 'F' or an 'M' (e.g. Billy, Felix, Mary) there is a special rule. The line which would 'rebuild' the name (e.g. bo-billy) is sang without the first letter of the name. The verse for the name Billy looks like this:
Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy!
For the name 'Felix', this would be right:
Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix!
- Metrics
- Counting
- Word frequency
- Letter frequency
- Jewels and stones
- I before E except after C
- Bioinformatics/base count
- Count occurrences of a substring
- Count how many vowels and consonants occur in a string
- Remove/replace
- XXXX redacted
- Conjugate a Latin verb
- Remove vowels from a string
- String interpolation (included)
- Strip block comments
- Strip comments from a string
- Strip a set of characters from a string
- Strip whitespace from a string -- top and tail
- Strip control codes and extended characters from a string
- Anagrams/Derangements/shuffling
- Word wheel
- ABC problem
- Sattolo cycle
- Knuth shuffle
- Ordered words
- Superpermutation minimisation
- Textonyms (using a phone text pad)
- Anagrams
- Anagrams/Deranged anagrams
- Permutations/Derangements
- Find/Search/Determine
- ABC words
- Odd words
- Word ladder
- Semordnilap
- Word search
- Wordiff (game)
- String matching
- Tea cup rim text
- Alternade words
- Changeable words
- State name puzzle
- String comparison
- Unique characters
- Unique characters in each string
- Extract file extension
- Levenshtein distance
- Palindrome detection
- Common list elements
- Longest common suffix
- Longest common prefix
- Compare a list of strings
- Longest common substring
- Find common directory path
- Words from neighbour ones
- Change e letters to i in words
- Non-continuous subsequences
- Longest common subsequence
- Longest palindromic substrings
- Longest increasing subsequence
- Words containing "the" substring
- Sum of the digits of n is substring of n
- Determine if a string is numeric
- Determine if a string is collapsible
- Determine if a string is squeezable
- Determine if a string has all unique characters
- Determine if a string has all the same characters
- Longest substrings without repeating characters
- Find words which contains all the vowels
- Find words which contains most consonants
- Find words which contains more than 3 vowels
- Find words which first and last three letters are equals
- Find words which odd letters are consonants and even letters are vowels or vice_versa
- Formatting
- Substring
- Rep-string
- Word wrap
- String case
- Align columns
- Literals/String
- Repeat a string
- Brace expansion
- Brace expansion using ranges
- Reverse a string
- Phrase reversals
- Comma quibbling
- Special characters
- String concatenation
- Substring/Top and tail
- Commatizing numbers
- Reverse words in a string
- Suffixation of decimal numbers
- Long literals, with continuations
- Numerical and alphabetical suffixes
- Abbreviations, easy
- Abbreviations, simple
- Abbreviations, automatic
- Song lyrics/poems/Mad Libs/phrases
- Mad Libs
- Magic 8-ball
- 99 Bottles of Beer
- The Name Game (a song)
- The Old lady swallowed a fly
- The Twelve Days of Christmas
- Tokenize
- Text between
- Tokenize a string
- Word break problem
- Tokenize a string with escaping
- Split a character string based on change of character
- Sequences
11l
<lang 11l>F print_verse(n)
V l = [String(‘b’), ‘f’, ‘m’] V s = n[1..] V? i = l.find(n[0].lowercase()) I i != N l[i] = ‘’ E I n[0] C (‘A’, ‘E’, ‘I’, ‘O’, ‘U’) s = n.lowercase() print("#., #., bo-#.#.\nBanana-fana fo-#.#.\nFee-fi-mo-#.#.\n#.!\n".format(n, n, l[0], s, l[1], s, l[2], s, n))
L(n) [‘Gary’, ‘Earl’, ‘Billy’, ‘Felix’, ‘Mary’]
print_verse(n)</lang>
Ada
<lang Ada>with Ada.Characters.Handling; with Ada.Strings.Unbounded; with Ada.Text_IO;
procedure The_Name_Game is
package ACH renames Ada.Characters.Handling; package ASU renames Ada.Strings.Unbounded; function "+"(input : in String) return ASU.Unbounded_String renames ASU.To_Unbounded_String; function "+"(input : in ASU.Unbounded_String) return String renames ASU.To_String; function Normalize_Case(input : in String) return String is begin return ACH.To_Upper(input(input'First)) & ACH.To_Lower(input(input'First + 1 .. input'Last)); end Normalize_Case;
function Transform(input : in String; letter : in Character) return String is begin case input(input'First) is when 'A' | 'E' | 'I' | 'O' | 'U' => return letter & ACH.To_Lower(input); when others => if ACH.To_Lower(input(input'First)) = letter then return input(input'First + 1 .. input'Last); else return letter & input(input'First + 1 .. input'Last); end if; end case; end Transform; procedure Lyrics(name : in String) is normalized : constant String := Normalize_Case(name); begin Ada.Text_IO.Put_Line(normalized & ", " & normalized & ", bo-" & Transform(normalized, 'b')); Ada.Text_IO.Put_Line("Banana-fana, fo-" & Transform(normalized, 'f')); Ada.Text_IO.Put_Line("fi-fee-mo-" & Transform(normalized, 'm')); Ada.Text_IO.Put_Line(normalized & '!'); Ada.Text_IO.New_Line; end Lyrics;
names : constant array(1 .. 5) of ASU.Unbounded_String := (+"Gary", +"EARL", +"billy", +"FeLiX", +"Mary");
begin
for name of names loop Lyrics(+name); end loop;
end The_Name_Game;</lang>
- Output:
Gary, Gary, bo-bary Banana-fana, fo-fary fi-fee-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana, fo-fearl fi-fee-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana, fo-filly fi-fee-mo-milly Billy! Felix, Felix, bo-belix Banana-fana, fo-elix fi-fee-mo-melix Felix! Mary, Mary, bo-bary Banana-fana, fo-fary fi-fee-mo-ary Mary!
ALGOL 68
<lang algol68> main:(
PROC print lyrics = (STRING name) VOID: BEGIN PROC change name = (STRING name, CHAR initial) STRING: BEGIN CHAR lower first = to lower(name[1]); IF char in string(lower first, NIL, "aeiou") THEN lower first + name[2:] ELIF lower first = initial THEN name[2:] ELSE initial + name[2:] FI END;
print((name, ", ", name, ", bo-", change name(name, "b"), new line, "Banana-fana fo-", change name(name, "f"), new line, "Fee-fi-mo-", change name(name, "m"), new line, name, "!", new line)) END;
[]STRING names = ("Gary", "Earl", "Billy", "Felix", "Mary");
FOR i FROM LWB names TO UPB names DO print lyrics(names[i]); print(new line) OD
) </lang>
AutoHotkey
<lang AutoHotkey>for i, x in StrSplit("Gary,Earl,Billy,Felix,Mary", ","){ BFM := false if (SubStr(x, 1, 1) ~= "i)^[AEIOU]") ; Vowel y := x else if (SubStr(x, 1, 1) ~= "i)^[BFM]") ; BFM y := SubStr(x,2), BFM := true else y := SubStr(x,2) StringLower, y, y output := X ", " X ", bo-" (SubStr(x,1,1)="b"&&BFM ? "" : "b") Y . "`nBanana-fana fo-" (SubStr(x,1,1)="f"&&BFM ? "" : "f") Y . "`nFee-fi-mo-" (SubStr(x,1,1)="m"&&BFM ? "" : "m") Y . "`n" X "!" result .= output "`n`n" } MsgBox, 262144, ,% result</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary!
AWK
<lang AWK>
- syntax: GAWK -f THE_NAME_GAME.AWK
BEGIN {
n = split("gary,earl,billy,felix,mary,shirley",arr,",") for (i=1; i<=n; i++) { print_verse(arr[i]) } exit(0)
} function print_verse(name, c,x,y) {
x = toupper(substr(name,1,1)) tolower(substr(name,2)) y = (x ~ /^[AEIOU]/) ? tolower(x) : substr(x,2) c = substr(x,1,1) printf("%s, %s, bo-%s%s\n",x,x,(c~/B/)?"":"b",y) printf("Banana-fana fo-%s%s\n",(c~/F/)?"":"f",y) printf("Fee-fi-mo-%s%s\n",(c~/M/)?"":"m",y) printf("%s!\n\n",x)
} </lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
BASIC256
<lang BASIC256>subroutine TheGameName(nombre) x = lower(nombre) x = upper(mid(x,1,1)) + (mid(x,2,length(x)-1)) x0 = upper(mid(x,1,1))
if x0 = "A" or x0 = "e" or x0 = "I" or x0 = "O" or x0 = "U" then y = lower(x) else y = mid(x,2,length(x)-1) end If
b = "b" + y f = "f" + y m = "m" + y
begin case case x0 = "B" b = y case x0 = "F" f = y case x0 = "M" m = y end case
print x + ", " + x + ", bo-" + b print "Banana-fana fo-" + f print "Fee-fi-mo-" + m print x + "!" + chr(10) end subroutine
dim listanombres[5] listanombres = {"Gary", "EARL", "billy", "FeLiX", "Mary", "ShirleY"} for i = 0 to listanombres[?]-1 call TheGameName(listanombres[i]) next i end</lang>
- Output:
Igual que la entrada de FreeBASIC.
C
<lang c>#include <stdio.h>
- include <string.h>
void print_verse(const char *name) {
char *x, *y; int b = 1, f = 1, m = 1, i = 1;
/* ensure name is in title-case */ x = strdup(name); x[0] = toupper(x[0]); for (; x[i]; ++i) x[i] = tolower(x[i]); if (strchr("AEIOU", x[0])) { y = strdup(x); y[0] = tolower(y[0]); } else { y = x + 1; }
switch(x[0]) { case 'B': b = 0; break; case 'F': f = 0; break; case 'M': m = 0; break; default : break; } printf("%s, %s, bo-%s%s\n", x, x, (b) ? "b" : "", y); printf("Banana-fana fo-%s%s\n", (f) ? "f" : "", y); printf("Fee-fi-mo-%s%s\n", (m) ? "m" : "", y); printf("%s!\n\n", x);
}
int main() {
int i; const char *names[6] = {"gARY", "Earl", "Billy", "Felix", "Mary", "sHIRley"}; for (i = 0; i < 6; ++i) print_verse(names[i]); return 0;
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
C#
<lang csharp>using System; using System.Collections.Generic; using System.Text;
namespace TheNameGame {
class Program { static void PrintVerse(string name) { StringBuilder sb = new StringBuilder(name.ToLower()); sb[0] = Char.ToUpper(sb[0]); string x = sb.ToString(); string y = "AEIOU".IndexOf(x[0]) > -1 ? x.ToLower() : x.Substring(1); string b = "b" + y; string f = "f" + y; string m = "m" + y; switch (x[0]) { case 'B': b = y; break; case 'F': f = y; break; case 'M': m = y; break; } Console.WriteLine("{0}, {0}, bo-{1}", x, b); Console.WriteLine("Banana-fana fo-{0}", f); Console.WriteLine("Fee-fi-mo-{0}", m); Console.WriteLine("{0}!", x); Console.WriteLine(); }
static void Main(string[] args) { List<string> nameList = new List<string>() { "Gary", "Earl", "Billy", "Felix", "Mary", "Steve" }; nameList.ForEach(PrintVerse); } }
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
C++
<lang cpp>#include <algorithm>
- include <iostream>
- include <string>
- include <vector>
static void printVerse(const std::string& name) {
std::string x = name; std::transform(x.begin(), x.end(), x.begin(), ::tolower); x[0] = toupper(x[0]);
std::string y; switch (x[0]) { case 'A': case 'E': case 'I': case 'O': case 'U': y = x; std::transform(y.begin(), y.end(), y.begin(), ::tolower); break; default: y = x.substr(1); break; }
std::string b("b" + y); std::string f("f" + y); std::string m("m" + y);
switch (x[0]) { case 'B': b = y; break; case 'F': f = y; break; case 'M': m = y; break; default: break; }
printf("%s, %s, bo-%s\n", x.c_str(), x.c_str(), b.c_str()); printf("Banana-fana fo-%s\n", f.c_str()); printf("Fee-fi-mo-%s\n", m.c_str()); printf("%s!\n\n", x.c_str());
}
int main() {
using namespace std;
vector<string> nameList{ "Gary", "Earl", "Billy", "Felix", "Mary", "Steve" }; for (auto& name : nameList) { printVerse(name); }
return 0;
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Commodore BASIC
This should be adaptable to most other 8-bit BASICs. After looking at some of the other examples, this example decides to tackle the task of checking for consonant blends (th, fr, sh, ch, chr, etc.) at the start of the name and handle it appropriately.
Note also the code on lines 30 and 75 to convert the case of the first letter... On some Commodore machines, the default is to render text in ALL CAPS, shifted letters become graphic symbols. This program sets the mode to display mixed case [chr$(14)] and then converts the first letter of the name for the purpose of uniform pattern matching in case the user types the name properly with a capitalized first letter.
<lang gwbasic>1 rem name game 2 rem rosetta code 5 dim cn$(3),bl$(3,32):gosub 1000
10 print chr$(147);chr$(14);"Name Game":print 15 cn$(0)="":cn$(1)="b":cn$(2)="f":cn$(3)="m" 20 print chr$(147);chr$(14);"Name Game":print:input "Enter any name";n$ 25 rem ensure first letter is lowercase 30 n$=chr$(asc(n$) and 95)+right$(n$,len(n$)-1) 35 rem check vowels 40 v$="aeiou":i$=left$(n$,1):v=0 45 for i=1 to 5:v=i$=mid$(v$,i,1):if not v then next i 50 if v then tn$=n$:goto 70 55 gosub 500 60 if bl then goto 70 65 tn$=right$(n$,len(n$)-1):gosub 600 70 rem capitalize first letter in name 75 n$=chr$(asc(n$) or 128)+right$(n$,len(n$)-1) 80 gosub 700 83 print:print "Again? (Y/N)" 85 get k$:if k$<>"y" and k$<>"n" then 85 90 if k$="y" then goto 10 95 end
500 rem check blends 510 bl=0:for g=3 to 1 step -1 520 l$=left$(n$,g+1):tn$=right$(n$,len(n$)-(g+1)) 530 for i=1 to 32:if l$=bl$(g,i) then bl=-1:return 540 next i:next g 550 return
600 rem check b, f, and m 610 for i=1 to 3:if cn$(i)=chr$(asc(n$)) then cn$(i)="" 620 next i:return
700 rem sing the verse 710 print:print n$;", ";n$;", bo-";cn$(1);tn$ 720 print " Banana-fana fo-";cn$(2);tn$ 730 print " Fee-fi-mo-";cn$(3);tn$ 740 print n$;"!" 750 return
1000 rem load blends 1010 for g=1 to 3 1015 for i=1 to 32 1020 read bl$(g,i):if bl$(g,i)="xx" then next g:return 1030 next i
2000 rem digraphs 2005 data bl,br,ch,ck,cl,cr,dr,fl,fr,gh,gl,gr,ng 2010 data ph,pl,pr,qu,sc,sh,sk,sl,sm,sn,sp,st,sw 2020 data th,tr,tw,wh,wr 2029 data xx 2030 rem trigraphs 2040 data chr,sch,scr,shr,spl,spr,squ,str,thr 2049 data xx 2050 rem quadgraph 2060 data schr,schl 2069 data xx</lang>
- Output:
Name Game Enter a name? Gary Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Again? (Y/N) Y Name Game Enter a name? Steve Steve, Steve, bo-beve Banana-fana fo-feve Fee-fi-mo-meve Steve! Again? (Y/N) Y Name Game Enter a name? Erik Erik, Erik, bo-berik Banana-fana fo-ferik Fee-fi-mo-merik Erik! Again? (Y/N) Y Enter a name? Charlie Charlie, Charlie, bo-barlie Banana-fana fo-farlie Fee-fi-mo-marlie Charlie! Again? (Y/N) Y Name Game Enter a name? Matthew Matthew, Matthew, bo-batthew Banana-fana fo-fatthew Fee-fi-mo-atthew Matthew! Again? (Y/N) N ready.
D
<lang d>import std.algorithm; import std.array; import std.conv; import std.stdio; import std.uni;
void printVerse(string name) {
auto sb = name.map!toLower.array; sb[0] = sb[0].toUpper;
string x = sb.to!string; string y; switch(sb[0]) { case 'A': case 'E': case 'I': case 'O': case 'U': y = x.map!toLower.to!string; break; default: y = x[1..$]; break; } string b = "b" ~ y; string f = "f" ~ y; string m = "m" ~ y; switch (x[0]) { case 'B': b = y; break; case 'F': f = y; break; case 'M': m = y; break; default: // no adjustment needed break; }
writeln(x, ", ", x, ", bo-", b); writeln("Banana-fana fo-", f); writeln("Fee-fi-mo-", m); writeln(x, "!\n");
}
void main() {
foreach (name; ["Gary","Earl","Billy","Felix","Mary","steve"]) { printVerse(name); }
}</lang>
F#
The function
<lang fsharp> // The Name Game. Nigel Galloway: March 28th., 2018 let fN g =
let fG α β γ = printfn "%s, %s, bo-%s\nBanana-fana fo-%s\nFee-fi-mo-%s\n%s!" g g α β γ g match g.ToLower().[0] with |'a'|'e'|'i'|'o'|'u' as n -> fG ("b"+(string n)+g.[1..]) ("f"+(string n)+g.[1..]) ("m"+(string n)+g.[1..]) |'b' -> fG (g.[1..]) ("f"+g.[1..]) ("m"+g.[1..]) |'f' -> fG ("b"+g.[1..]) (g.[1..]) ("m"+g.[1..]) |'m' -> fG ("b"+g.[1..]) ("f"+g.[1..]) (g.[1..]) |_ -> fG ("b"+g.[1..]) ("f"+g.[1..]) ("m"+g.[1..])
</lang>
The Task
<lang fsharp> fN "Nigel" </lang>
- Output:
Nigel, Nigel, bo-bigel Banana-fana fo-figel Fee-fi-mo-migel Nigel!
<lang fsharp> fN "Earl" </lang>
- Output:
Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl!
<lang fsharp> fN "Billy" </lang>
- Output:
Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy!
<lang fsharp> fN "Fred" </lang>
- Output:
Fred, Fred, bo-bred Banana-fana fo-red Fee-fi-mo-mred Fred!
<lang fsharp> fN "Mum" </lang>
- Output:
Mum, Mum, bo-bum Banana-fana fo-fum Fee-fi-mo-um Mum!
Factor
<lang factor>USING: ascii combinators interpolate io kernel locals pair-rocket qw sequences ; IN: rosetta-code.name-game
- vowel? ( char -- ? ) "AEIOU" member? ;
- name-game ( Name -- )
Name first :> L Name >lower :> name! L vowel? [ name rest name! ] unless "b" :> B! "f" :> F! "m" :> M! L { CHAR: B => [ "" B! ] CHAR: F => [ "" F! ] CHAR: M => [ "" M! ] [ drop ] } case
[I ${Name}, ${Name}, bo-${B}${name} Banana-fana fo-${F}${name} Fee-fi-mo-${M}${name} ${Name}!I] nl nl ;
qw{ Gary Earl Billy Felix Milton Steve } [ name-game ] each</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Milton, Milton, bo-bilton Banana-fana fo-filton Fee-fi-mo-ilton Milton! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
FreeBASIC
<lang freebasic>Sub TheGameName(nombre As String)
Dim As String x = Lcase(nombre) x = Ucase(Mid(x,1,1)) + (Mid(x,2,Len(x)-1)) Dim As String x0 = Ucase(Mid(x,1,1)) Dim As String y If x0 = "A" Or x0 = "E" Or x0 = "I" Or x0 = "O" Or x0 = "U" Then y = Lcase(x) Else y = Mid(x,2) End If Dim As String b = "b" + y, f = "f" + y, m = "m" + y
Select Case x0 Case "B" : b = y Case "F" : f = y Case "M" : m = y End Select Print x + ", " + x + ", bo-" + b Print "Banana-fana fo-" + f Print "Fee-fi-mo-" + m Print x + "!" + Chr(10)
End Sub
Dim listanombres(5) As String = {"Gary", "EARL", "billy", "FeLiX", "Mary", "ShirlEY"} For i As Integer = 0 To Ubound(listanombres)
TheGameName(listanombres(i))
Next i Sleep</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
Go
<lang go>package main
import (
"fmt" "strings"
)
func printVerse(name string) {
x := strings.Title(strings.ToLower(name)) y := x[1:] if strings.Contains("AEIOU", x[:1]) { y = strings.ToLower(x) } b := "b" + y f := "f" + y m := "m" + y switch x[0] { case 'B': b = y case 'F': f = y case 'M': m = y } fmt.Printf("%s, %s, bo-%s\n", x, x, b) fmt.Printf("Banana-fana fo-%s\n", f) fmt.Printf("Fee-fi-mo-%s\n", m) fmt.Printf("%s!\n\n", x)
}
func main() {
names := [6]string{"gARY", "Earl", "Billy", "Felix", "Mary", "SHIRley"} for _, name := range names { printVerse(name) }
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
Haskell
<lang Haskell> -- The Name Game, Ethan Riley, 22nd May 2018 import Data.Char
isVowel :: Char -> Bool isVowel c
| char == 'A' = True | char == 'E' = True | char == 'I' = True | char == 'O' = True | char == 'U' = True | otherwise = False where char = toUpper c
isSpecial :: Char -> Bool isSpecial c
| char == 'B' = True | char == 'F' = True | char == 'M' = True | otherwise = False where char = toUpper c
shorten :: String -> String shorten name
| isVowel $ head name = map toLower name | otherwise = map toLower $ tail name
line :: String -> Char -> String -> String line prefix letter name
| letter == char = prefix ++ shorten name ++ "\n" | otherwise = prefix ++ letter:[] ++ shorten name ++ "\n" where char = toLower $ head name
theNameGame :: String -> String theNameGame name =
line (name ++ ", " ++ name ++ ", bo-") 'b' name ++ line "Banana-fana fo-" 'f' name ++ line "Fee-fi-mo-" 'm' name ++ name ++ "!\n"
main =
mapM_ (putStrLn . theNameGame) ["Gary", "Earl", "Billy", "Felix", "Mike", "Steve"]
</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mike, Mike, bo-bike Banana-fana fo-fike Fee-fi-mo-ike Mike! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
J
Substitutions must conform to the region they replace. Cannot directly substitute 'Gary' where 'X' occurs in the template. Work instead with boxes, then at the end raze them to recover the verse. <lang J> T=:TEMPLATE=: noun define
(X), (X), bo-b(Y) Banana-fana fo-f(Y) Fee-fi-mo-m(Y) (X)!
)
nameGame=: monad define
X=. y Y=. tolower }.^:('aeiouAEIOU' -.@:e.~ {.) y heady=. tolower {. y t=. TEMPLATE -. '()' 'ix iy'=. I. 'XY' =/ t tbox=. ;/ t match=. heady = (<: iy){::"0 _ tbox remove =. match # iy special_rule_box=. a: (<: remove)}tbox ybox=. (< Y) iy} special_rule_box XBox=. (< X) ix} ybox ; XBox
) </lang>
nameGame&> ;:'Gary Earl Billy Felix Mary' Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary!
Java
<lang Java>import java.util.stream.Stream;
public class NameGame {
private static void printVerse(String name) { StringBuilder sb = new StringBuilder(name.toLowerCase()); sb.setCharAt(0, Character.toUpperCase(sb.charAt(0))); String x = sb.toString(); String y = "AEIOU".indexOf(x.charAt(0)) > -1 ? x.toLowerCase() : x.substring(1); String b = "b" + y; String f = "f" + y; String m = "m" + y; switch (x.charAt(0)) { case 'B': b = y; break; case 'F': f = y; break; case 'M': m = y; break; default: // no adjustment needed break; } System.out.printf("%s, %s, bo-%s\n", x, x, b); System.out.printf("Banana-fana fo-%s\n", f); System.out.printf("Fee-fi-mo-%s\n", m); System.out.printf("%s!\n\n", x); }
public static void main(String[] args) { Stream.of("Gary", "Earl", "Billy", "Felix", "Mary", "Steve").forEach(NameGame::printVerse); }
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Julia
<lang julia>import Compat: uppercasefirst
function printverse(name::AbstractString)
X = uppercasefirst(lowercase(name)) Y = X[1] ∈ ('A', 'E', 'I', 'O', 'U') ? X : SubString(X, 2) b = X[1] == 'B' ? "" : "b" f = X[1] == 'F' ? "" : "f" m = X[1] == 'M' ? "" : "m" println("""\ $(X), $(X), bo-$b$(Y) Banana-fana fo-$f$(Y) Fee-fi-mo-$m$(Y) $(X)! """) return nothing
end
foreach(TheNameGame.printverse, ("gARY", "Earl", "Billy", "Felix", "Mary", "sHIRley"))</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bEarl Banana-fana fo-fEarl Fee-fi-mo-mEarl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
Kotlin
<lang scala>// version 1.2.31
fun printVerse(name: String) {
val x = name.toLowerCase().capitalize() val y = if (x[0] in "AEIOU") x.toLowerCase() else x.substring(1) var b = "b$y" var f = "f$y" var m = "m$y" when (x[0]) { 'B' -> b = "$y" 'F' -> f = "$y" 'M' -> m = "$y" else -> {} // no adjustment needed } println("$x, $x, bo-$b") println("Banana-fana fo-$f") println("Fee-fi-mo-$m") println("$x!\n")
}
fun main(args: Array<String>) {
listOf("Gary", "Earl", "Billy", "Felix", "Mary", "Steve").forEach { printVerse(it) }
}</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Lua
<lang lua>function printVerse(name)
local sb = string.lower(name) sb = sb:gsub("^%l", string.upper) local x = sb local x0 = x:sub(1,1)
local y if x0 == 'A' or x0 == 'E' or x0 == 'I' or x0 == 'O' or x0 == 'U' then y = string.lower(x) else y = x:sub(2) end
local b = "b" .. y local f = "f" .. y local m = "m" .. y
if x0 == 'B' then b = y elseif x0 == 'F' then f = y elseif x0 == 'M' then m = y end
print(x .. ", " .. x .. ", bo-" .. b) print("Banana-fana fo-" .. f) print("Fee-fi-mo-" .. m) print(x .. "!") print()
return nil
end
local nameList = { "Gary", "Earl", "Billy", "Felix", "Mary", "Steve" } for _,name in pairs(nameList) do
printVerse(name)
end</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
M2000 Interpreter
Function format$ with one parameter (a string) process escape codes so we can alter line song$ ...
song$=format$("\r\n{0}, {0}, bo-{2}{1}\r\nBanana-fana fo-{3}{1}\r\nFee-fi-mo-{4}{1}\r\n{0}!\r\n")
<lang M2000 Interpreter> Module The.Name.Game {
Flush Data "Gary", "Earl","Billy","Felix" Document doc$="The Name Game"+{ } Report doc$ song$={ {0}, {0}, bo-{2}{1} Banana-fana fo-{3}{1} Fee-fi-mo-{4}{1} {0}! } While not empty { Read x$ x$=ucase$(left$(x$,1))+lcase$(mid$(x$,2)) b$=if$(x$ ~ "B*"->"", "b") f$=if$(x$ ~ "F*"->"", "f") m$=if$(x$ ~ "M*"->"", "m") y$=if$(x$ ~ "[AEIOU]*"->lcase$(x$),Mid$(x$, 2)) toprint$=format$(song$, x$, y$, b$, f$, m$) doc$=toprint$ report toprint$ } Clipboard doc$
} The.Name.Game </lang>
- Output:
The Name Game Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix!
min
<lang min>("AEIOU" "" split swap in?) :vowel?
(
:Name Name "" split first :L Name lowercase :name (L vowel?) (name "" split rest "" join @name) unless "b" :B "f" :F "m" :M ( ((L "B" ==) ("" @B)) ((L "F" ==) ("" @F)) ((L "M" ==) ("" @M)) ) case "$1, $1, bo-$3$2\nBanana-fana fo-$4$2\nFee-fi-mo-$5$2\n$1!\n" (Name name B F M) => % puts!
) :name-game
("Gary" "Earl" "Billy" "Felix" "Milton" "Steve") 'name-game foreach</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Milton, Milton, bo-bilton Banana-fana fo-filton Fee-fi-mo-ilton Milton! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Modula-2
<lang modula2>MODULE NameGame; FROM Strings IMPORT Concat; FROM ExStrings IMPORT Lowercase; FROM Terminal IMPORT WriteString, WriteLn, ReadChar;
PROCEDURE PrintVerse(name : ARRAY OF CHAR); TYPE String = ARRAY[0..64] OF CHAR; VAR y,b,f,m : String; BEGIN
Lowercase(name);
CASE name[0] OF 'a','e','i','o','u' : y := name; ELSE y := name[1..LENGTH(name)]; END;
Concat("b", y, b); Concat("f", y, f); Concat("m", y, m);
CASE name[0] OF 'b' : b := y; | 'f' : f := y; | 'm' : m := y; ELSE END;
name[0] := CAP(name[0]);
(* Line 1 *) WriteString(name); WriteString(", "); WriteString(name); WriteString(", bo-"); WriteString(b); WriteLn;
(* Line 2 *) WriteString("Banana-fana fo-"); WriteString(f); WriteLn;
(* Line 3 *) WriteString("Fee-fi-mo-"); WriteString(m); WriteLn;
(* Line 4 *) WriteString(name); WriteString("!"); WriteLn;
WriteLn;
END PrintVerse;
BEGIN
PrintVerse("Gary"); PrintVerse("Earl"); PrintVerse("Billy"); PrintVerse("Felix"); PrintVerse("Mary"); PrintVerse("Steve");
ReadChar;
END NameGame.</lang>
Nanoquery
<lang Nanoquery>def print_verse(n)
l = {"b", "f", "m"} s = n.substring(1) if lower(n[0]) in l ind = l[lower(n[0])] l[ind] = "" else if n[0] in {"A", "E", "I", "O", "U"} s = lower(n) end
println format("%s, %s, bo-%s%s", n, n, l[0], s) println format("Banana-fana fo-%s%s", l[1], s) println format("Fee-fi-mo-%s%s", l[2], s) println n + "!\n"
end
names = {"Gary", "Earl", "Billy", "Felix", "Mary"} for n in names
print_verse(n)
end</lang>
Nim
<lang Nim>import strutils
const
StdFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" WovelFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" BFmt = "$1, $1, bo-$2\nBanana-fana fo-f$2\nFee-fi-mo-m$2\n$1!" FFmt = "$1, $1, bo-b$2\nBanana-fana fo-$2\nFee-fi-mo-m$2\n$1!" MFmt = "$1, $1, bo-b$2\nBanana-fana fo-f$2\nFee-fi-mo-$2\n$1!"
proc lyrics(name: string): string =
let tail = name[1..^1] result = case name[0].toUpperAscii of 'A', 'E', 'I', 'O', 'U', 'Y': WovelFmt.format(name, name.toLowerAscii) of 'B': BFmt.format(name, tail) of 'F': FFmt.format(name, tail) of 'M': MFmt.format(name, tail) else: StdFmt.format(name, tail) result = result.capitalizeAscii()
for name in ["Gary", "Earl", "Billy", "Felix", "Mary"]:
echo name.lyrics() echo()</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary!
Perl
<lang perl>sub printVerse {
$x = ucfirst lc shift; $x0 = substr $x, 0, 1; $y = $x0 =~ /[AEIOU]/ ? lc $x : substr $x, 1; $b = $x0 eq 'B' ? $y : 'b' . $y; $f = $x0 eq 'F' ? $y : 'f' . $y; $m = $x0 eq 'M' ? $y : 'm' . $y; print "$x, $x, bo-$b\n" . "Banana-fana fo-$f\n" . "Fee-fi-mo-$m\n" . "$x!\n\n";
}
printVerse($_) for <Gary Earl Billy Felix Mary Steve>;</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Phix
constant fmt = """ %s, %s, bo-%s Banana-fana fo-%s Fee-fi-mo-%s %s! """ procedure printVerse(string name) string x = lower(name) integer x1 = upper(x[1]), vowel = find(x1,"AEIUO")!=0 string y = x[2-vowel..$], b = 'b'&y, f = 'f'&y, m = 'm'&y x[1] = x1 switch x1 do case 'B': b = y case 'F': f = y case 'M': m = y end switch printf(1,fmt,{x, x, b, f, m, x}) end procedure constant tests = {"gARY", "Earl", "Billy", "Felix", "Mary", "SHIRley"} for i=1 to length(tests) do printVerse(tests[i]) end for
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Shirley, Shirley, bo-bhirley Banana-fana fo-fhirley Fee-fi-mo-mhirley Shirley!
PowerShell
<lang Powershell>
- Clear Host from old Ouput
Clear-Host
$Name = Read-Host "Please enter your name" $Char = ($name.ToUpper())[0] IF (($Char -eq "A") -or ($Char -eq "E") -or ($Char -eq "I") -or ($Char -eq "O") -or ($Char -eq "U"))
{ Write-Host "$Name, $Name, bo-b$($Name.ToLower())" }
else
{ IF ($Char -eq "B") { Write-Host "$Name, $Name, bo-$($Name.Substring(1))" } else { Write-Host "$Name, $Name, bo-b$($Name.Substring(1))" } }
IF (($Char -eq "A") -or ($Char -eq "E") -or ($Char -eq "I") -or ($Char -eq "O") -or ($Char -eq "U")) { Write-Host "Banana-fana fo-f$($Name.ToLower())" }
else
{ IF ($Char -eq "F") { Write-Host "Banana-fana fo-$($Name.Substring(1))" } else { Write-Host "Banana-fana fo-f$($Name.Substring(1))" } }
IF (($Name[0] -eq "A") -or ($Name[0] -eq "E") -or ($Name[0] -eq "I") -or ($Name[0] -eq "O") -or ($Name[0] -eq "U")) { Write-Host "Fee-fi-mo-m$($Name.tolower())" }
else
{ IF ($Char -eq "M") { Write-Host "Fee-fi-mo-$($Name.Substring(1))" } else { Write-Host "Fee-fi-mo-m$($Name.Substring(1))" } }
Write-Host "$Name" </lang>
Prolog
<lang Prolog>map_name1(C, Cs, C, Cs). map_name1(C, Cs, Fc, [Fc,C|Cs]) :- member(C, ['a','e','i','o','u']). map_name1(C, Cs, Fc, [Fc|Cs]) :-
\+ member(C, ['a','e','i','o','u']), dif(C, Fc).
map_name(C, Cs, Fc, Name) :-
map_name1(C, Cs, Fc, NChars), atom_chars(Name, NChars).
song(Name) :-
string_lower(Name, LName), atom_chars(LName, [First|Chars]), map_name(First, Chars, 'b', BName), map_name(First, Chars, 'f', FName), map_name(First, Chars, 'm', MName), maplist(write, [Name, ", ", Name, ", bo-", BName, '\n', "Banana-fana fo-", FName, '\n', "Fee-fi-mo-", MName, '\n', Name, "!\n\n"]).
test :-
maplist(song, ["Gary", "Earl", "Billy", "Felix", "Mary"]).</lang>
- Output:
1 ?- test. Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! true
Python
<lang Python>def print_verse(n):
l = ['b', 'f', 'm'] s = n[1:] if str.lower(n[0]) in l: l[l.index(str.lower(n[0]))] = elif n[0] in ['A', 'E', 'I', 'O', 'U']: s = str.lower(n) print('{0}, {0}, bo-{2}{1}\nBanana-fana fo-{3}{1}\nFee-fi-mo-{4}{1}\n{0}!\n'.format(n, s, *l))
- Assume that the names are in title-case and they're more than one character long
for n in ['Gary', 'Earl', 'Billy', 'Felix', 'Mary']:
print_verse(n)</lang>
q
String search and replace
<lang q>game_ssr:{[Name]
V:raze 1 lower\"AEIOUY"; / vowels tn:lower((Name in V)?1b) _ Name; / truncated Name s3:{1(-1_)\x,"o-",x}lower first Name; / 3rd ssr s:"$1, $1, bo-b$2\nBanana-fana-fo-f$2\nFee-fimo-m$2\n$1!\n\n"; (ssr/).(s;("$1";"$2";s3 0);(Name;tn;s3 1)) }
</lang>
Amend a list of strings
<lang q>game_amend:{[Name]
pfx:Name,", ",Name,", "; / prefix n:lower Name; sfx:((n in "aeiouy")?1b)_n; / suffix s:("bo-b";"Banana-fana fo-f";"Fee-fimo-m";"!";""); / song template @[;0;pfx,] @[;3;Name,] @[;0 1 2;,[;sfx]] @[;where n[0]=last each s;-1_] s }
// test 1 "\n"sv raze game_ssr each ("Gary";"Earl";"Felix";"Stephen";"Ryan";"Jo"); </lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fimo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fimo-mearl Earl! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fimo-melix Felix! Stephen, Stephen, bo-bephen Banana-fana fo-fephen Fee-fimo-mephen Stephen! Ryan, Ryan, bo-byan Banana-fana fo-fyan Fee-fimo-myan Ryan! Jo, Jo, bo-bo Banana-fana fo-fo Fee-fimo-mo Jo!
Raku
(formerly Perl 6)
Meh. The rules leave out some corner cases (see Steve) but what the heck, technically correct is the best kind of correct.
<lang perl6>sub mangle ($name, $initial) {
my $fl = $name.lc.substr(0,1); $fl ~~ /<[aeiou]>/ ?? $initial~$name.lc !! $fl eq $initial ?? $name.substr(1) !! $initial~$name.substr(1)
}
sub name-game (Str $name) {
qq:to/NAME-GAME/; $name, $name, bo-{ mangle $name, 'b' } Banana-fana fo-{ mangle $name, 'f' } Fee-fi-mo-{ mangle $name, 'm' } $name! NAME-GAME
}
say .&name-game for <Gary Earl Billy Felix Mike Steve></lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mike, Mike, bo-bike Banana-fana fo-fike Fee-fi-mo-ike Mike! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
REXX
Extra code was added to the REXX program to capitalize the name (and lowercase all characters in the name except the 1st character).
Also, dual names are supported (like Mary Ann).
<lang rexx>/*REXX program displays the lyrics of the song "The Name Game" by Shirley Ellis. */
parse arg $ /*obtain optional argument(s) from C.L.*/
if $= then $="gAry, eARL, billy, FeLix, MarY" /*Not specified? Then use the default.*/
/* [↑] names separated by commas. */ do j=1 until $=; $=space($) /*elide superfluous blanks from list. */ parse var $ name',' $ /*get name (could be 2 words) from list*/ call song name /*invoke subroutine to display lyrics. */ end /*j*/
exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ song: arg c 2 1 z; @b='b'; @f="f"; @m='m' /*obtain name; assign three variables.*/
@abc= 'abcdefghijklmnopqrstuvwxyz'; @abcU=@abc; upper @abcU /*build 2 alphabets*/ z=c || translate( substr(z, 2),@abc,@abcU) /*capitalize name, lowercase the rest. */ parse var z f 2 1 z /*get name, 1st letter, rest of name. */ y=substr(z, 2); zl=translate(z, @abc, @abcU) /*lowercase 2 vars.*/ select when pos(f, 'AEIOU')\==0 then do; say z',' z", bo-b"zl say 'Banana-fana fo-f'zl say 'Fee-fi-mo-m'zl end when pos(f, 'BFM' )\==0 then do; if f=='B' then @b= if f=='F' then @f= if f=='M' then @m= say z',' z", bo-"@b || y say 'Banana-fana fo-'@f || y say 'Fee-fi-mo-'@m || y end otherwise say z',' z", bo-b"y say 'Banana-fana fo-f'y say 'Fee-fi-mo-m'y end /*select*/ say z'!'; say return</lang>
- output when using the default (internal) names:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary!
Ruby
More idiomatic Ruby while not being object-oriented. Also, like the Commodore Basic version, we handle consonants at the start of the name using a Regular Expression so we can handle appropriately names like Steve or Chris. Byron is an interesting edge-case because has a "y" and also starts with "b". <lang ruby>#!/usr/bin/env ruby
def print_verse(name)
first_letter_and_consonants_re = /^.[^aeiyou]*/i
full_name = name.capitalize # X suffixed = case full_name[0] # Y when 'A','E','I','O','U' name.downcase else full_name.sub(first_letter_and_consonants_re, ) end
b_name = "b#{suffixed}" f_name = "f#{suffixed}" m_name = "m#{suffixed}"
case full_name[0] when 'B' b_name = suffixed when 'F' f_name = suffixed when 'M' m_name = suffixed end
puts <<~END_VERSE #{full_name}, #{full_name}, bo-#{b_name} Banana-fana fo-#{f_name} Fee-fi-mo-#{m_name} #{full_name}!
END_VERSE
end
%w[Gary Earl Billy Felix Mary Steve Chris Byron].each do |name|
print_verse name
end
</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-beve Banana-fana fo-feve Fee-fi-mo-meve Steve! Chris, Chris, bo-bis Banana-fana fo-fis Fee-fi-mo-mis Chris! Byron, Byron, bo-yron Banana-fana fo-fyron Fee-fi-mo-myron Byron!
Scala
<lang Scala>object NameGame extends App {
private def printVerse(name: String): Unit = { val x = name.toLowerCase.capitalize
val y = if ("AEIOU" contains x.head) x.toLowerCase else x.tail
val (b, f, m) = x.head match { case 'B' => (y, "f" + y, "m" + y) case 'F' => ("b" + y, y, "m" + y) case 'M' => ("b" + y, "f" + y, y) case _ => ("b" + y, "f" + y, "m" + y) }
printf("%s, %s, bo-%s\n", x, x, b) printf("Banana-fana fo-%s\n", f) println(s"Fee-fi-mo-$m") println(s"$x!\n") }
Stream("gAry", "earl", "Billy", "Felix", "Mary", "Steve").foreach(printVerse)
}</lang>
See it running in your browser by Scastie (JVM).
UNIX Shell
This implements the required rules and also attempts to handle names that start with consonant clusters.
<lang sh>#!/usr/bin/env bash namegame() {
local name=$1 b=b f=f m=m local rhyme=${name#[^AaEeIiOoUu]} while [[ $rhyme == [^AaEeIiOoUuYy]* ]]; do rhyme=${rhyme#?} done if [[ "$rhyme" == [AEIOU]* ]]; then rhyme=$(tr A-Z a-z <<<"$rhyme") fi if [[ $name == [Bb]* ]]; then b= fi if [[ $name == [Ff]* ]]; then f= fi if [[ $name == [Mm]* ]]; then m= fi printf '%s, %s, bo-%s%s\n' "$name" "$name" "$b" "$rhyme" printf 'Banana-fana fo-%s%s\n' "$f" "$rhyme" printf 'Fee-fi-mo-%s%s\n' "$m" "$rhyme" printf '%s!\n' "$name"
}
for name in Gary Earl Billy Felix Mark Frank; do
namegame "$name" echo
done</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mark, Mark, bo-bark Banana-fana fo-fark Fee-fi-mo-ark Mark! Frank, Frank, bo-bank Banana-fana fo-ank Fee-fi-mo-mank Frank!
VBA
<lang vb>Option Explicit
Sub Main() Dim a, r, i As Integer Const SCHEM As String = "(X), (X), bo-b(Y)^Banana-fana fo-f(Y)^Fee-fi-mo-m(Y)^(X)!^"
'init a = Array("GaRY", "Earl", "Billy", "Felix", "Mary", "Mike", "Frank") 'compute r = TheGameName(a, SCHEM) 'return For i = LBound(r) To UBound(r) Debug.Print r(i) Next i
End Sub
Private Function TheGameName(MyArr, S As String) As String() Dim i As Integer, s1 As String, s2 As String, tp As String, t() As String
ReDim t(UBound(MyArr)) For i = LBound(MyArr) To UBound(MyArr) tp = Replace(S, "^", vbCrLf) s2 = LCase(Mid(MyArr(i), 2)): s1 = UCase(Left(MyArr(i), 1)) & s2 Select Case UCase(Left(MyArr(i), 1)) Case "A", "E", "I", "O", "U": tp = Replace(tp, "(Y)", LCase(MyArr(i))) Case "B", "F", "M" tp = Replace(tp, "(Y)", s2) tp = Replace(tp, LCase(MyArr(i)), s2) Case Else: tp = Replace(tp, "(Y)", s2) End Select t(i) = Replace(tp, "(X)", s1) Next TheGameName = t
End Function</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Mike, Mike, bo-bike Banana-fana fo-fike Fee-fi-mo-ike Mike! Frank, Frank, bo-brank Banana-fana fo-rank Fee-fi-mo-mrank Frank!
Visual Basic .NET
<lang vbnet>Option Strict On
Imports System.Text
Module Module1
Sub PrintVerse(name As String) Dim sb As New StringBuilder(name.ToLower()) sb(0) = Char.ToUpper(sb(0))
Dim x = sb.ToString() Dim y = If("AEIOU".IndexOf(x(0)) > -1, x.ToLower(), x.Substring(1)) Dim b = "b" + y Dim f = "f" + y Dim m = "m" + y Select Case x(0) Case "B"c b = y Exit Select Case "F"c f = y Exit Select Case "M"c m = y Exit Select End Select
Console.WriteLine("{0}, {0}, bo-{1}", x, b) Console.WriteLine("Banana-fana fo-{0}", f) Console.WriteLine("Fee-fi-mo-{0}", m) Console.WriteLine("{0}!", x) Console.WriteLine() End Sub
Sub Main() Dim nameList As New List(Of String) From {"Gary", "Earl", "Billy", "Felix", "Mary", "Steve"} nameList.ForEach(AddressOf PrintVerse) End Sub
End Module</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
Wren
<lang ecmascript>import "/str" for Str
var printVerse = Fn.new { |name|
var x = Str.capitalize(Str.lower(name)) var z = x[0] var y = "AEIOU".contains(z) ? Str.lower(x) : x[1..-1] var b = "b%(y)" var f = "f%(y)" var m = "m%(y)" if (z == "B") { b = y } else if (z == "F") { f = y } else if (z == "M") { m = y } System.print("%(x), %(x), bo-%(b)") System.print("Banana-fana fo-%(f)") System.print("Fee-fi-mo-%(m)") System.print("%(x)!\n")
}
["Gary", "Earl", "Billy", "Felix", "Mary", "Steve"].each { |name| printVerse.call(name) }</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!
zkl
<lang zkl>fcn printVerse(name){
z,x := name[0].toLower(), z.toUpper() + name[1,*].toLower(); y:=( if("aeiou".holds(z)) name.toLower() else x[1,*] ); b,f,m := T("b","f","m").apply('wrap(c){ z==c and y or c+y }); println("%s, %s, bo-%s".fmt(x,x,b)); println("Banana-fana fo-",f); println("Fee-fi-mo-",m); println(x,"!\n");
}</lang> <lang zkl>List("Gary", "Earl", "Billy", "Felix", "Mary", "Steve").apply2(printVerse);</lang>
- Output:
Gary, Gary, bo-bary Banana-fana fo-fary Fee-fi-mo-mary Gary! Earl, Earl, bo-bearl Banana-fana fo-fearl Fee-fi-mo-mearl Earl! Billy, Billy, bo-illy Banana-fana fo-filly Fee-fi-mo-milly Billy! Felix, Felix, bo-belix Banana-fana fo-elix Fee-fi-mo-melix Felix! Mary, Mary, bo-bary Banana-fana fo-fary Fee-fi-mo-ary Mary! Steve, Steve, bo-bteve Banana-fana fo-fteve Fee-fi-mo-mteve Steve!