Add 2019/adamovsky/try.sh, crash.unl + formatting
The crash.unl is what the judges put in their remarks (and at the end of the file they say more). It was added so one can see what is meant. Updated bugs.md for this - INABIAF. The try.sh script is as usual. The README.md file has been format/typo checked.
This commit is contained in:
Cody Boone Ferguson committed
1 parent
eb73925850
commit
ae420f7b32
5 files changed
+125
-44
No files matched your search
+70
-44
@@ -5,6 +5,17 @@ make
|
||||
```
|
||||
|
||||
|
||||
### Bugs and (Mis)features:
|
||||
|
||||
The current status of this entry is:
|
||||
|
||||
```
|
||||
STATUS: INABIAF - please **DO NOT** fix
|
||||
```
|
||||
|
||||
For more detailed information see [2019 adamovsky in bugs.md](/bugs.md#2019-adamovsky).
|
||||
|
||||
|
||||
## To use:
|
||||
|
||||
```sh
|
||||
@@ -15,17 +26,13 @@ make
|
||||
### Try:
|
||||
|
||||
```sh
|
||||
./prog spam.unl
|
||||
|
||||
./prog sierpinski.unl | less
|
||||
|
||||
./prog advent.unl
|
||||
./try.sh
|
||||
```
|
||||
|
||||
|
||||
## Judges' remarks:
|
||||
|
||||
Even after pre-processing and indenting, the C code of this entry
|
||||
Even after pre-processing and indenting, the C code of this entry it
|
||||
is about as understandable as the Unlambda code.
|
||||
|
||||
Pretending that we don't know a bit of functional programming :) and lacking a
|
||||
@@ -38,10 +45,16 @@ bytes which crashed it:
|
||||
|
||||
Functional programming is not a panacea against core dumps, after all.
|
||||
|
||||
This can be demonstrated by:
|
||||
|
||||
```sh
|
||||
./prog crash.unl
|
||||
```
|
||||
|
||||
|
||||
## Author's remarks:
|
||||
|
||||
**»A highly structured state state machine«**
|
||||
### A highly structured state state machine
|
||||
|
||||
### Purpose:
|
||||
|
||||
@@ -49,17 +62,18 @@ The purpose of this program is to allow you to play Colossal Cave Adventure as
|
||||
implemented by [Kunihiko Sakamoto][1]. As that was written in [Unlambda programming
|
||||
language][2] designed by David Alexander Madore it has to be an Unlambda interpreter.
|
||||
|
||||
|
||||
### Aesthetics:
|
||||
|
||||
The program grew a bit too long so I had to use several macros to downsize it.
|
||||
That unfortunately reduced my options for program layout. I decided to separate
|
||||
it into two portions. The initial macro section where I had limited resources
|
||||
and you should disregard its shape, unless you like it, and the rest is a
|
||||
it into two portions: the initial macro section where I had limited resources
|
||||
which you should disregard its shape, unless you like it, and the rest, which is a
|
||||
separator in the form of a single line followed by a section signifying the
|
||||
function of the program, a block with removed shape of lambda character. Even
|
||||
the official IOCCC size tool acknowledges this: When you call `./iocccsize -i
|
||||
<prog.c`, using the [2019 version of
|
||||
iocccsize](https://www.ioccc.org/2019/iocccsize.c), iocccsize returns **955**,
|
||||
iocccsize](/2019/iocccsize.c), iocccsize returns **955**,
|
||||
which is the Unicode codepoint of the **λ** character.
|
||||
|
||||
It might be a surprise for you that according to the IOCCC size tool the program is
|
||||
@@ -82,6 +96,8 @@ and run it like this:
|
||||
./prog advent.unl
|
||||
```
|
||||
|
||||
> NOTE: the file was added to the entry so there is no need to download it.
|
||||
|
||||
You can also try other programs from the Web. Many example programs are in the official
|
||||
[Unlambda distribution][3] on the Unlambda homepage. The most complex programs there are
|
||||
entries from [quine contest][4].
|
||||
@@ -97,18 +113,21 @@ It will build the tool and use it to build an alternative program `prog2`, which
|
||||
produce an Unlambda program `identify.unl`. `make identify` runs this program to identify
|
||||
itself.
|
||||
|
||||
The base program (`prog`) implements an interpreter of Unlambda 2.0. It recognises all its
|
||||
builtins (`k`, `s`, `i`, `v`, `c`, `d`, `.x`, `e`, `@`, `?x` and `|`) including the syntactic sugar function
|
||||
`r` and formatting properties in the form of ignoring whitespace and comments
|
||||
to the end of line introduced by the `#` character.
|
||||
The base program (`prog`) implements an interpreter of Unlambda 2.0. It
|
||||
recognises all its builtins (`k`, `s`, `i`, `v`, `c`, `d`, `.x`, `e`, `@`, `?x`
|
||||
and `|`) including the syntactic sugar function `r` and formatting properties in
|
||||
the form of ignoring whitespace and comments to the end of line introduced by
|
||||
the `#` character.
|
||||
|
||||
In case of wrong usage (missing Unlambda program file or missing parameter) or use of an unseekable
|
||||
Unlambda program source if it uses the `c` function, the program returns message `fail`. It
|
||||
also informs you about syntactic errors in the Unlambda program should there be any (but only
|
||||
when the execution reaches them).
|
||||
In case of wrong usage (missing Unlambda program file or missing parameter) or
|
||||
use of an unseekable (`fseek(3)`) Unlambda program source if it uses the `c`
|
||||
function, the program returns the message `fail`. It also informs you about
|
||||
syntactic errors in the Unlambda program should there be any (but only when the
|
||||
execution reaches them).
|
||||
|
||||
The Unlambda source file may contain several Unlambda programs. The interpreter
|
||||
will run them all in sequence.
|
||||
|
||||
The Unlambda source file may contain several Unlambda programs. The interpreter will run
|
||||
them all in sequence.
|
||||
|
||||
### Unlambda
|
||||
|
||||
@@ -117,19 +136,21 @@ a brief introduction or its [homepage][2] for an in depth discussion. For furthe
|
||||
can visit Wikipedia pages on [Lambda Calculus][6] and [Combinatory Logic][7].
|
||||
|
||||
You can also play with an [online interpreter][8] by GitHub user inazz. There you can
|
||||
debug one of example programs provided or try your wits in writing your own.
|
||||
debug one of the example programs provided or try your wits in writing your own.
|
||||
|
||||
|
||||
### Hints:
|
||||
|
||||
Here are some pointers where to start when trying to understand the interpreter:
|
||||
|
||||
- Where is syntax error detected?
|
||||
- Where are syntax errors detected?
|
||||
- How is the memory managed?
|
||||
- How does a program character turn into a function?
|
||||
- How does exit function *e* work?
|
||||
- Can fD0 function be called?
|
||||
- How does exit function `e` work?
|
||||
- Can `fD0` function be called?
|
||||
- Are the function names familiar? (warning: some are misleading)
|
||||
|
||||
|
||||
### Obfuscation sources
|
||||
|
||||
- The elephant in the room is the Unlambda language. As we all know, functional
|
||||
@@ -138,19 +159,21 @@ unintelligible and hard to code in. Most of its functions are quite simple and
|
||||
straightforward to implement, but two make it a mess: the promise operator `d`
|
||||
and the call with current continuation `c`.
|
||||
- Most of the additional obfuscation is derived from basic design choices. That
|
||||
is, how the state of the program is stored and how are the Unlambda functions
|
||||
is, how the state of the program is stored and how the Unlambda functions are
|
||||
implemented.
|
||||
|
||||
More on this in the **Spoilers** section.
|
||||
|
||||
|
||||
### Build notes:
|
||||
|
||||
The program does not require any special treatment by compilers. Some warnings
|
||||
had to be suppressed when compiling with `-Wall -Wextra -pedantic`. Those were
|
||||
produced because of the formatting of the source code, not any programming
|
||||
technique. Compilation with `-Weverything` produced many more warnings, but those
|
||||
are only relevant for multi-source-file projects and some are really questionable
|
||||
(e.g. `-Wdisabled-macro-expansion`).
|
||||
technique. Compilation with `clang -Weverything` produced many more warnings,
|
||||
but those are only relevant for multi-source-file projects and some are really
|
||||
questionable (e.g. `-Wdisabled-macro-expansion`).
|
||||
|
||||
|
||||
### Portability:
|
||||
|
||||
@@ -164,21 +187,22 @@ without it, but the stack runs out quickly with some Unlambda programs (e.g.
|
||||
segfault). Clang with `-O3` option does this optimization well and said example
|
||||
does not segfault with it. I was not able to force GCC to optimize it out
|
||||
(probably an operator fault).
|
||||
- The only data structure of the program (the union structure) had much more
|
||||
members originally. I joined all integers to a single long long member in the
|
||||
- The only data structure of the program (the `union`) had much more
|
||||
members originally. I joined all integers to a single `long long` member in the
|
||||
name of obfuscation. It is used for reference counting (only 1 for every
|
||||
reference) among other uses. `size_t` should be used for that, but practically,
|
||||
I think the memory would run out sooner than the reference counter in any real
|
||||
world situation even when `size_t` is bigger than `long long`. It is also used
|
||||
for storing chars for later printing. This might produce some warnings, but
|
||||
since it was developed using chars it should be always used safely.
|
||||
for storing `char`s for later printing. This might produce some warnings, but
|
||||
since it was developed using `char`s it should be always used safely.
|
||||
|
||||
|
||||
### Spoilers:
|
||||
|
||||
- You can examine the [progSpoiler.c](progSpoiler.c) file. It is the original
|
||||
final version of the interpreter, before I started the downsizing. It accepts
|
||||
one more optional parameter that specifies filename for the output Unlambda
|
||||
function (it's the Unlambda function, that remains after all function
|
||||
one more optional parameter that specifies a filename for the output Unlambda
|
||||
function (it's the Unlambda function that remains after all function
|
||||
applications are done). When no filename is provided, `stderr` is used.
|
||||
|
||||
The function *output* is used for this additional functionality. You can use
|
||||
@@ -209,32 +233,34 @@ away, and the stack stored in the continuation is restored.
|
||||
|
||||
This makes implementation of a complete debugger a bit more challenging.
|
||||
|
||||
For this to work, the functions that do the work (i.e. make series of applications
|
||||
For this to work, the functions that do the work (i.e. make a series of applications
|
||||
and/or evaluations each of which may be a call to current continuation), the `s`
|
||||
combinator and the `` ` `` application operation had to be broken down to pieces, one
|
||||
for each application/evaluation and corresponding helper functions for stack
|
||||
rebuilding. (the helper functions are named beginning with *r* instead of *f*)
|
||||
rebuilding. (the helper functions are named beginning with `r` instead of `f`)
|
||||
|
||||
- The `` ` `` application operation does the reading of the Unlambda source when
|
||||
needed. It also implements the promise function. Whenever it would apply it, it
|
||||
overwrites the Apply constructor in translation array `T`, changing its function
|
||||
to build unevaluated subtree that is later evaluated whenever the promise is
|
||||
to build an unevaluated sub-tree that is later evaluated whenever the promise is
|
||||
applied.
|
||||
|
||||
- To further the obfuscation, I shortened the function names while downsizing,
|
||||
but preserved their meaning (with the exception of Apply functions, which I
|
||||
renamed to Y to possibly confuse with Y combinator). Simple functions retained
|
||||
renamed to `Y` to possibly confuse with `Y` combinator). Simple functions retained
|
||||
their names to misguide the reader to believe to know what is what. The names of
|
||||
continuation and exit functions were swapped. The names of S and Apply functions
|
||||
were shuffled both for S functions and Apply functions in the same way to hide
|
||||
continuation and exit functions were swapped. The names of `S` and Apply functions
|
||||
were shuffled both for `S` functions and Apply functions in the same way to hide
|
||||
the meaning of `f` and `r` prefixes.
|
||||
|
||||
|
||||
### Identification spoiler:
|
||||
|
||||
The alternative build path `make identify` output commemorates a [previous IOCCC
|
||||
winner][9] which uses similar methods to mess with the size tool.
|
||||
|
||||
### Judges' remarks spoilers:
|
||||
|
||||
### Judges' spoilers:
|
||||
|
||||
It is not a bug, it is a feature. :)
|
||||
|
||||
@@ -249,12 +275,12 @@ system settings (on Linux) or compiler options (on Windows) if your Unlambda
|
||||
program needs it. Nevertheless, it will not help the judges' program which
|
||||
quickly depletes any limit you define.
|
||||
|
||||
The judges, pretending not to know what they are doing, created a program that
|
||||
The judges, pretending to not know what they are doing, created a program that
|
||||
grows Unlambda execution stack indefinitely. You may consider it an Unlambda
|
||||
anti-pattern. Normally, infinite cycles in Unlambda work by creating two
|
||||
functions and applying one to the other which creates further functions to
|
||||
apply. The application of the function frees its position on the stack. This
|
||||
program builds one ever growing function that will never be complete and able to
|
||||
program builds one ever growing function that will never be complete and be able to
|
||||
be applied.
|
||||
|
||||
[1]: https://github.com/irori/advent-unlambda "Adventure"
|
||||
@@ -265,7 +291,7 @@ be applied.
|
||||
[6]: https://en.wikipedia.org/wiki/Lambda_calculus "Lambda Calculus on Wikipedia"
|
||||
[7]: https://en.wikipedia.org/wiki/Combinatory_logic "Combinatory Logic on Wikipedia"
|
||||
[8]: https://inazz.jp/unlambda/ "Online Unlambda interpreter"
|
||||
[9]: http://ioccc.org/2014/birken/hint.html "Best use of port 1701"
|
||||
[9]: /2014/birken/README.md "Best use of port 1701"
|
||||
|
||||
|
||||
## Copyright and CC BY-SA 4.0 License:
|
||||
|
||||
@@ -0,0 +1 @@
|
||||
````.0`.0`.0`c.0``sssss
|
||||
Executable
+37
@@ -0,0 +1,37 @@
|
||||
#!/usr/bin/env bash
|
||||
#
|
||||
# try.sh - demonstrate IOCCC winner 2019/adamovsky
|
||||
#
|
||||
|
||||
# make sure CC is set so that when we do make CC="$CC" it isn't empty. Doing it
|
||||
# this way allows us to have the user specify a different compiler in an easy
|
||||
# way.
|
||||
if [[ -z "$CC" ]]; then
|
||||
CC="cc"
|
||||
fi
|
||||
|
||||
make CC="$CC" all >/dev/null || exit 1
|
||||
|
||||
# clear screen after compilation so that only the entry is shown
|
||||
clear
|
||||
|
||||
echo 1>&2
|
||||
echo "$ ./prog spam.unl | head -n 100 | less -EXF" 1>&2
|
||||
read -r -n 1 -p "Press any key to continue: "
|
||||
echo 1>&2
|
||||
./prog spam.unl | head -n 100 | less -EXF
|
||||
echo 1>&2
|
||||
|
||||
echo "$ ./prog sierpinski.unl | head -n 200 | less -EXF" 1>&2
|
||||
read -r -n 1 -p "Press any key to continue: "
|
||||
echo 1>&2
|
||||
./prog sierpinski.unl | head -n 200 | less -EXF
|
||||
|
||||
echo "$ make identify" 1>&2
|
||||
make identify
|
||||
echo 1>&2
|
||||
|
||||
read -r -p "Do you want to play Colossal Cave Adventure (Y/N)? "
|
||||
if [[ "$REPLY" == "Y" || "$REPLY" == "y" ]]; then
|
||||
./prog advent.unl
|
||||
fi
|
||||
@@ -3257,6 +3257,16 @@ The author wrote the following:
|
||||
# 2019
|
||||
|
||||
|
||||
## 2019 adamovsky
|
||||
|
||||
### STATUS: INABIAF - please **DO NOT** fix
|
||||
### Source code: [2019/adamovsky/prog.c](/2019/adamovsky/prog.c)
|
||||
### Information: [2019/adamovsky/README.md](/2019/adamovsky/README.md)
|
||||
|
||||
Certain input can crash this program. The file
|
||||
[crash.unl](/2019/adamovsky/crash.unl) is an example file.
|
||||
|
||||
|
||||
## 2019 duble
|
||||
|
||||
### STATUS: INABIAF - please **DO NOT** fix
|
||||
|
||||
@@ -4094,6 +4094,13 @@ if the user wants to see some of the spoilers and only show them if they type
|
||||
# <a name="2019"></a>2019
|
||||
|
||||
|
||||
## <a name="2019_adamovsky"></a>[2019/adamovsky](/2019/adamovsky/prog.c) ([README.md](/2019/adamovsky/README.md]))
|
||||
|
||||
[Cody](#cody) added the [try.sh](/2019/adamovsky/try.sh) script and the Unlambda
|
||||
file [crash.unl](/2019/adamovsky/crash.unl) which is in the judges' remarks as
|
||||
to what can crash it - but it's not a bug, it's a feature.
|
||||
|
||||
|
||||
## <a name="2019_burton"></a>[2019/burton](/2019/burton/prog.c) ([README.md](/2019/burton/README.md]))
|
||||
|
||||
[Cody](#cody) fixed the Makefile which had a bad character, a '%' instead of a '$' which
|
||||
|
||||
Reference in new issue
Block a user