Convert phrases to reverse style

Question

The Challenge

Convert a phrase of two words to reverse style: candy bar -> bar le candy.

Specifications

• There will be one word (only a-zA-Z0-9 + -), a space (), and then another word.
• For equal length, score is used to determine winner.

Test cases:

candy bar -> bar le candy
code golf -> golf le code
programming puzzles -> puzzles le programming

Answer 1

CJam, 9 bytes

rr" le "@

Try it online!

Pushes first 2 tokens and then the " le " literal to stack, and then rotates the stack, moving the first word to the end of the stack. Output of the resulting stack is implied.

Answer 2

Reng v.3.3, 55 bytes

Try it here!

1#zaií1ø
):Weq!vz1+#z
br[zÀz/]; !o
le"Wro/ !ob"
    ~;/

I can probably golf it by taking input until a space is found, as this approach takes all input at once.

Explanation

Input & init

1#zaií1ø

1#z stores 1 to z. a is a one-sided mirror from the left side, meaning you can pass through it from left-to-right, but not otherwise. i takes a char of input, and í mirrors iff there is input on the input stack. Otherwise, it proceeds. 1ø goes to the next line.

Print first word

):Weq!vz1+#z

) rotates the stack left one, : duplicates it, We checks for the equality with a space, and !v goes down iff it is a space and goes to the next phase. z1+#z increments z otherwise.

(more to come)

---

Here's a GIF:

Answer 3

Vim 9 keystrokes

dwA le <esc>p

I'm so close to beating pyth and Cjam! Unfortunately, I can't figure out how to take any more off, so I'll have to be satisfied with tying. =)

Explanation:

dw             'Delete a word
  A le <esc>   'Enter " le " at the end of the current line 
            p  'Paste the previously deleted text

Answer 4

Pyth - 9 bytes

j" le "_c

Test Suite.

Answer 5

MATL, 12 bytes

Yb'le'h7L)Zc

Try it online!

Yb       % Take input implicitly. Split by spaces. Gives a cell array
'le'     % Push this string
h        % Concatenate horizontally into cell array
7L       % Push [2 3 1]
)        % Apply as index, to change order
Zc       % Join with spaces. Gives a string. Display implicitly

Answer 6

Python 3, 41 bytes

print(' le '.join(input().split()[::-1]))

Answer 7

R, 30 bytes

cat(rev(scan(,"")),sep=" le ")

This is a full program that accepts reads a string from STDIN and prints to STDOUT. The scan function implicitly separates space-delimited input into elements of an array. We then just reverse the array and print it, using le as a separator between elements in the output.

Answer 8

GS2, 9 bytes

, ♦ le ♣2

Try it online!

Answer 9

IPOS, 13 bytes

rS!r%S" le "R

Could < 10 bytes if I had implemented all the builtins that I have planned...

Explanation

r         # Reverse the input
S!r%      # Reverse every word -> Word order is now swapped
S" le "R  # insert a " le " between the two words by replacing the space

Non-competing 9-byte version

This only works with the version I pushed just now (implemented C).

SC"le"@Sj

This works by splitting the input on spaces to obtain the two words (SC), pushing the literal le, rotating the stack (@) so the words are swapped and the le is between them and finally joining the stack on spaces (SJ).

Again, could be shorter since I also plan to add commands for joining and splitting on spaces which would make this 7 bytes. But since those are probably gonna be non-ASCII characters and I haven't fully figured out the codepage I am gonna use, those have to wait a bit.

Answer 10

JavaScript (ES6), 34 32 bytes

s=>(a=s.split` `)[1]+" le "+a[0]

Saved 2 bytes thanks to @jrich!

Answer 11

Jelly, 9 bytes

ṣ⁶Ṛj“ le 

Try it online!

Answer 12

><>, 35 bytes

i:" "=?v
ov?(0:i<
"\~~r" el 
o>l?!;

The first line reads a character of the first word and put it on the stack, then goes to the second line if it encounters " " or otherwise loops.
The second line reads a character of the second word and prints it right away, then goes to the third line when if encounters EOF or otherwise loops.
The third line removes the space and the EOF from the stack, reverts it and pushes " le " backward, then goes to the fourth line.
The fourth line stops execution if the stack is empty, otherwise it prints a character of the stack (poping it) and loops.

Answer 13

Pyke, 10 bytes

dcX"le"RdJ

Try it here!

Or 9 bytes (noncompeting, add insert)

Dd@" le":

Try it here!

Answer 14

Java 8, 41 39 bytes

A simple lambda, for a simple challenge

s->s.replaceAll("(.+) (.+)","$2 le $1")

---

Update

• -3 [17-02-23] Thanks to @Kevin

Answer 15

Japt, 9 8 bytes

Note the trailing space.

¸w q` ¤ 

• Saved a byte thanks to a reminder from obarakon.

Try it online

---

Explanation

        :Implicit input of string U
¸       :Split to array on space
w       :Reverse
q.      :Join to string...
` ¤     : with the compressed string " le "

Answer 16

Python, 37 bytes

lambda s:" le ".join(s.split()[::-1])

Answer 17

Python 2, 34 bytes

a,b=input().split();print b,"le",a

Expects input in quotes.

>> "code golf"
golf le code

Answer 18

Jolf, 10 bytes

Try it here!

R_pti" le 
  pti      input split by spaces
 _         reversed
R    " le  joined by that string

Answer 19

BATCH file, 14 bytes

@ECHO %2 le %1

Save to a file and invoke as notFrench word1 word2.

C:\Users\Conor O'Brien\Documents\Programming\PPCG>notFrench code golf
golf le code

C:\Users\Conor O'Brien\Documents\Programming\PPCG>

Answer 20

Go, 81 bytes

import."strings"
func f(s string)string{h:=Split(s," ")
return h[1]+" le "+h[0]}

Answer 21

Perl, 18 bytes

/ /;$_="$' le $`"

This program is 17 bytes long and requires the -p switch (+1 byte).

Answer 22

Lua, 46 Bytes

a=(...):gsub("(%w+) (%w+)","%2 le %1")print(a)

I save the result of gsub to a variable because it returns 2 values, and would therefore print a 1 which is the number of changes made to the string. The other work around is about disallowing gsub's return to unpack. Also, it is actually longer by 1 byte:

print((...):gsub("(%w+) (%w+)","%2 le %1")..'')

Answer 23

Retina, 14 bytes

Byte count assumes ISO 8859-1 encoding.

M!r`\S+
¶
 le 

Try it online! (Slightly modified to process all test cases at once.)

The first stage reverses the two words and separates them by a linefeed (this is done by matching them with right-to-left mode and printing all matches).

The second stage replaces the linefeed (¶) with le .

Answer 24

Mathematica, 30 bytes

#2<>" le "<>#&@@StringSplit@#&

Not very complicated...

Answer 25

Seriously, 13 bytes

"le"' ,so/' j

Try it online

Explanation:

"le"' ,so/' j
    ' ,s       split input on space
"le"    o/     stick "le" between words
          ' j  join on space

Answer 26

Gawk, 17 16 bytes

1 byte off thanks to muru

{$0=$2" le "$1}1

Old

{print$2" le "$1}

Answer 27

Ruby, 24 bytes

->s{s=~/ /;"#$' le #$`"}

Try it online!

Answer 28

PHP, 47 Bytes

<?=preg_filter("#(.+) (.+)#","$2 le $1",$argn);

Try it online!

Answer 29

C# - 43 bytes

string.Join(" le ",x.Split(' ').Reverse());