mirror of
https://github.com/coding-horror/basic-computer-games.git
synced 2025-12-23 07:29:02 -08:00
Ported SYNONYM to Javascript
This commit is contained in:
9
85 Synonym/javascript/synonym.html
Normal file
9
85 Synonym/javascript/synonym.html
Normal file
@@ -0,0 +1,9 @@
|
|||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<title>SYNONYM</title>
|
||||||
|
</head>
|
||||||
|
<body>
|
||||||
|
<pre id="output" style="font-size: 12pt;"></pre>
|
||||||
|
<script src="synonym.js"></script>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
124
85 Synonym/javascript/synonym.js
Normal file
124
85 Synonym/javascript/synonym.js
Normal file
@@ -0,0 +1,124 @@
|
|||||||
|
// SYNONYM
|
||||||
|
//
|
||||||
|
// Converted from BASIC to Javascript by Oscar Toledo G. (nanochess)
|
||||||
|
//
|
||||||
|
|
||||||
|
function print(str)
|
||||||
|
{
|
||||||
|
document.getElementById("output").appendChild(document.createTextNode(str));
|
||||||
|
}
|
||||||
|
|
||||||
|
function input()
|
||||||
|
{
|
||||||
|
var input_element;
|
||||||
|
var input_str;
|
||||||
|
|
||||||
|
return new Promise(function (resolve) {
|
||||||
|
input_element = document.createElement("INPUT");
|
||||||
|
|
||||||
|
print("? ");
|
||||||
|
input_element.setAttribute("type", "text");
|
||||||
|
input_element.setAttribute("length", "50");
|
||||||
|
document.getElementById("output").appendChild(input_element);
|
||||||
|
input_element.focus();
|
||||||
|
input_str = undefined;
|
||||||
|
input_element.addEventListener("keydown", function (event) {
|
||||||
|
if (event.keyCode == 13) {
|
||||||
|
input_str = input_element.value;
|
||||||
|
document.getElementById("output").removeChild(input_element);
|
||||||
|
print(input_str);
|
||||||
|
print("\n");
|
||||||
|
resolve(input_str);
|
||||||
|
}
|
||||||
|
});
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
function tab(space)
|
||||||
|
{
|
||||||
|
var str = "";
|
||||||
|
while (space-- > 0)
|
||||||
|
str += " ";
|
||||||
|
return str;
|
||||||
|
}
|
||||||
|
|
||||||
|
var ra = [, "RIGHT", "CORRECT", "FINE", "GOOD!", "CHECK"];
|
||||||
|
var la = [];
|
||||||
|
var tried = [];
|
||||||
|
|
||||||
|
var synonym = [[5,"FIRST","START","BEGINNING","ONSET","INITIAL"],
|
||||||
|
[5,"SIMILAR","ALIKE","SAME","LIKE","RESEMBLING"],
|
||||||
|
[5,"MODEL","PATTERN","PROTOTYPE","STANDARD","CRITERION"],
|
||||||
|
[5,"SMALL","INSIGNIFICANT","LITTLE","TINY","MINUTE"],
|
||||||
|
[6,"STOP","HALT","STAY","ARREST","CHECK","STANDSTILL"],
|
||||||
|
[6,"HOUSE","DWELLING","RESIDENCE","DOMICILE","LODGING","HABITATION"],
|
||||||
|
[7,"PIT","HOLE","HOLLOW","WELL","GULF","CHASM","ABYSS"],
|
||||||
|
[7,"PUSH","SHOVE","THRUST","PROD","POKE","BUTT","PRESS"],
|
||||||
|
[6,"RED","ROUGE","SCARLET","CRIMSON","FLAME","RUBY"],
|
||||||
|
[7,"PAIN","SUFFERING","HURT","MISERY","DISTRESS","ACHE","DISCOMFORT"]
|
||||||
|
];
|
||||||
|
|
||||||
|
// Main program
|
||||||
|
async function main()
|
||||||
|
{
|
||||||
|
print(tab(33) + "SYNONYM\n");
|
||||||
|
print(tab(15) + "CREATIVE COMPUTING MORRISTOWN, NEW JERSEY\n");
|
||||||
|
print("\n");
|
||||||
|
print("\n");
|
||||||
|
print("\n");
|
||||||
|
for (c = 0; c <= synonym.length; c++)
|
||||||
|
tried[c] = false;
|
||||||
|
print("A SYNONYM OF A WORD MEANS ANOTHER WORD IN THE ENGLISH\n");
|
||||||
|
print("LANGUAGE WHICH HAS THE SAME OR VERY NEARLY THE SAME");
|
||||||
|
print(" MEANING.\n");
|
||||||
|
print("I CHOOSE A WORD -- YOU TYPE A SYNONYM.\n");
|
||||||
|
print("IF YOU CAN'T THINK OF A SYNONYM, TYPE THE WORD 'HELP'\n");
|
||||||
|
print("AND I WILL TELL YOU A SYNONYM.\n");
|
||||||
|
print("\n");
|
||||||
|
c = 0;
|
||||||
|
while (c < synonym.length) {
|
||||||
|
c++;
|
||||||
|
do {
|
||||||
|
n1 = Math.floor(Math.random() * synonym.length + 1);
|
||||||
|
} while (tried[n1]) ;
|
||||||
|
tried[n1] = true;
|
||||||
|
n2 = synonym[n1][0]; // Length of synonym list
|
||||||
|
// This array keeps a list of words not shown
|
||||||
|
for (j = 1; j <= n2; j++)
|
||||||
|
la[j] = j;
|
||||||
|
la[0] = n2;
|
||||||
|
g = 1; // Always show first word
|
||||||
|
print("\n");
|
||||||
|
la[g] = la[la[0]]; // Replace first word with last word
|
||||||
|
la[0] = n2 - 1; // Reduce size of list by one.
|
||||||
|
print("\n");
|
||||||
|
while (1) {
|
||||||
|
print(" WHAT IS A SYNONYM OF " + synonym[n1][g]);
|
||||||
|
str = await input();
|
||||||
|
if (str == "HELP") {
|
||||||
|
g1 = Math.floor(Math.random() * la[0] + 1);
|
||||||
|
print("**** A SYNONYM OF " + synonym[n1][g] + " IS " + synonym[n1][la[g1]] + ".\n");
|
||||||
|
print("\n");
|
||||||
|
la[g1] = la[la[0]];
|
||||||
|
la[0]--;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
for (k = 1; k <= n2; k++) {
|
||||||
|
if (g == k)
|
||||||
|
continue;
|
||||||
|
if (str == synonym[n1][k])
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (k > n2) {
|
||||||
|
print(" TRY AGAIN.\n");
|
||||||
|
} else {
|
||||||
|
print(synonym[n1][Math.floor(Math.random() * 5 + 1)] + "\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
print("\n");
|
||||||
|
print("SYNONYM DRILL COMPLETED.\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
main();
|
||||||
Reference in New Issue
Block a user