How to resolve the algorithm Quine step by step in the ERRE programming language
How to resolve the algorithm Quine step by step in the ERRE programming language
Table of Contents
Problem Statement
A quine is a self-referential program that can, without any external access, output its own source.
A quine (named after Willard Van Orman Quine) is also known as:
It is named after the philosopher and logician
who studied self-reference and quoting in natural language,
as for example in the paradox "'Yields falsehood when preceded by its quotation' yields falsehood when preceded by its quotation."
"Source" has one of two meanings. It can refer to the text-based program source.
For languages in which program source is represented as a data structure, "source" may refer to the data structure: quines in these languages fall into two categories: programs which print a textual representation of themselves, or expressions which evaluate to a data structure which is equivalent to that expression.
The usual way to code a quine works similarly to this paradox: The program consists of two identical parts, once as plain code and once quoted in some way (for example, as a character string, or a literal data structure). The plain code then accesses the quoted code and prints it out twice, once unquoted and once with the proper quotation marks added. Often, the plain code and the quoted code have to be nested.
Write a program that outputs its own source code in this way. If the language allows it, you may add a variant that accesses the code directly. You are not allowed to read any external files with the source code. The program should also contain some sort of self-reference, so constant expressions which return their own value which some top-level interpreter will print out. Empty programs producing no output are not allowed. There are several difficulties that one runs into when writing a quine, mostly dealing with quoting:
Next to the Quines presented here, many other versions can be found on the Quine page.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Quine step by step in the ERRE programming language
Source code in the erre programming language
PROGRAM QUINE
BEGIN
READ(D$,Y$)
LOOP
READ(X$)
EXIT IF LEN(X$)<1
PRINT(X$)
END LOOP
RESTORE
LOOP
READ(X$)
EXIT IF LEN(X$)<1
PRINT(D$;CHR$(34);X$;CHR$(34);CHR$(41))
END LOOP
PRINT(D$;CHR$(34);CHR$(34);CHR$(41))
PRINT(Y$)
DATA("DATA(")
DATA("END PROGRAM")
DATA("PROGRAM QUINE")
DATA("BEGIN")
DATA("READ(D$,Y$)")
DATA("LOOP")
DATA(" READ(X$)")
DATA(" EXIT IF LEN(X$)<1")
DATA(" PRINT(X$)")
DATA("END LOOP")
DATA("RESTORE")
DATA("LOOP")
DATA(" READ(X$)")
DATA(" EXIT IF LEN(X$)<1")
DATA(" PRINT(D$;CHR$(34);X$;CHR$(34);CHR$(41))")
DATA("END LOOP")
DATA("PRINT(D$;CHR$(34);CHR$(34);CHR$(41))")
DATA("PRINT(Y$)")
DATA("")
END PROGRAM
You may also check:How to resolve the algorithm Pseudo-random numbers/Splitmix64 step by step in the Forth programming language
You may also check:How to resolve the algorithm Old lady swallowed a fly step by step in the 8080 Assembly programming language
You may also check:How to resolve the algorithm Non-decimal radices/Convert step by step in the PL/M programming language
You may also check:How to resolve the algorithm Sorting algorithms/Permutation sort step by step in the EchoLisp programming language
You may also check:How to resolve the algorithm Animate a pendulum step by step in the Scheme programming language