Spanish Builder I

This program is a two-way vocabulary quiz that tests the user on word pairs stored in parallel string arrays, supporting both English-to-foreign and foreign-to-English directions. The language name is held in the variable `L$`, and word pairs are stored in `E$()` (English) and `F$()` (foreign), with `W` holding the total word count — all presumably initialized in an earlier, not-listed portion of the program. A previously-answered-word tracking mechanism uses array `C$()` and counter `Q` to prevent repeating questions within a single round. Correct answers are displayed in a decorative tiled pattern using nested `FOR` loops with `PRINT AT` across multiple screen positions. The program auto-saves itself with `SAVE “SPANBLDR1” LINE 85` to preserve the vocabulary data between sessions.

---

Program Analysis

Program Structure

This listing is a fragment of a larger vocabulary-building program (the name “SPANBLDR1” in the SAVE command suggests a Spanish vocabulary builder). Lines before 86 are not shown but presumably handle initialization of L$, E$(), F$(), W, and C$(). The visible code divides into three logical blocks:

1. Lines 86–135: Main menu and round control loop
2. Lines 700–820: Subroutine — English-to-foreign quiz
3. Lines 900–1015: Subroutine — Foreign-to-English quiz

Variable Usage

Variable	Purpose
L$	Name of the target language (e.g., “SPANISH”)
E$()	Array of English words
F$()	Array of foreign-language words
W	Total number of word pairs
Q	Count of words answered in the current round
C$()	Array recording already-used words to prevent repeats
R	Randomly selected word index
CH	User’s menu choice (1 or 2)
A$	User’s input answer (collected but not evaluated)

Anti-Repeat Mechanism

Both quiz subroutines use a linear scan of the C$() array to ensure that a randomly selected word has not already been tested in the current round. In subroutine 700 (lines 715–725), if F$(R) matches any previously stored C$(P), a new random index is chosen by jumping back to line 705. The same logic appears at lines 910–920 in subroutine 900, checking E$(R) against C$(P). This is a simple but effective guard against repetition, though it could loop indefinitely if W is small and all words have been used — a condition that should not occur because the round ends when Q=W.

Answer Display — Tiled Pattern

After revealing the correct answer, both subroutines display the answer word tiled across the screen using nested FOR loops (lines 783–785 and 976–978). The outer loop steps Y from 0 to 30 in steps of 12 (columns), and the inner loop steps X from 10 to 20 in steps of 2 (rows), printing the word at each intersection with PRINT AT X,Y. This creates a decorative grid of repeated correct answers as visual reinforcement.

Bugs and Anomalies

• Answer is never checked: In both subroutines, the user’s input is stored in A$ but is never compared to the correct answer. The program always reveals the correct answer unconditionally. There is no right/wrong feedback, score tracking, or differentiation between correct and incorrect responses.
• Subroutine 900 never increments Q or stores to C$() via its own path: Lines 1000–1015 handle the Q increment and C$(Q) assignment for Test 2, but line 986 jumps directly back to line 900 (GO TO 900) without passing through line 1000. This means Q is never incremented in the foreign-to-English test, and the round-complete condition Q=W at line 1005 is never reached. The Test 2 subroutine effectively loops forever and never returns.
• Line 130 / 135 keypress logic: PAUSE 0 at line 127 waits for any key, but lines 130 and 135 then read INKEY$ in sequential statements. Since PAUSE 0 resumes on any keypress and the key may no longer be held, the INKEY$ reads at 130 and 135 may both return empty string, causing neither branch to execute and the program to fall through to the STOP at line 9997.
• Line 135 prints 240 as a literal number: PRINT 240 outputs the numeric value 240, which appears to be a mistake — likely intended to be a string message or a line reference that was incorrectly coded.
• Line 130 references GO TO 90 but the listing begins at line 86, suggesting line 90 exists in the unlisted initialization section.

Key BASIC Idioms

• Delay loop via FOR D=1 TO 200: NEXT D at line 800 — a busy-wait timing technique.
• PAUSE 90 at line 980 provides a fixed ~1.6-second pause before continuing.
• INT (W*RND)+1 produces a random integer in the range 1 to W, the standard idiom for selecting a random array index.