This probably only works in Unicon. It also defaults to showing the factal for F_word25 as
larger Fibonacci words quickly exceed the size of window I can display, even with a line segment length of
a single pixel.

Plotting the fractal as a parametric equation, this looks reasonably nice:

require 'plot'plot }:+/\ 0,*/\(^~ 0j_10j1 $~ #)'0'=_1{::F_Words 20

Note that we need the definition of F_Words from the Fibonacci word page:

F_Words=: (,<@;@:{~&_1_2)@]^:(2-~[)&('1';'0')

However, image uploads are currently disabled, and rendering images of this sort as wikitext gets bulky.

Instead, I'll just describe the algorithm:

This draws a discrete parametric curve. Right turn is 0j_1, left turn is 0j1 (negative and positive square roots of negative 1), straight ahead is 1. So: build a list of alternating 0j_1 and 0j1 and raise them to the first power for the 0s in the fibonacci word list and raise them to the 0th power for the 1s in that list. Then compute the running product, shift a 0 onto the front of the list of products and compute the running sum. (Of course, this would translate to a rather simple loop, also, once you see the pattern.)

fibonacci.word.fractal can draw any number of line segments. A Fibonacci number shows the self-similar nature of the fractal. The Fibonacci word values which control the turns are generated here by some bit-twiddling iteration.

Programming note: the starting point (.) and the ending point (∙) are also shown to help visually identify the end points.
About half of the REXX program is dedicated to plotting the appropriate character.

Prime candidate for Turtle Graphics.
I've used a values-turtle, which means you don't get the joy of seeing the turltle
bimble around the screen. But it allows the size of the image to be set (useful if you
want to push the n much higher than 23 or so!

We use word-order 23, which gives a classic n shape (inverted horseshoe).

Save the (first) implementation of Fibonacci word to Fibonacci-word.rkt; since
we do not generate the words here.