How to resolve the algorithm Idiomatically determine all the lowercase and uppercase letters step by step in the BASIC programming language

Published on 12 May 2024 09:40 PM
#Basic

How to resolve the algorithm Idiomatically determine all the lowercase and uppercase letters step by step in the BASIC programming language

Table of Contents

Problem Statement

Idiomatically determine all the lowercase and uppercase letters   (of the Latin [English] alphabet)   being used currently by a computer programming language. The method should find the letters regardless of the hardware architecture that is being used (ASCII, EBCDIC, or other).

Display the set of all: that can be used (allowed) by the computer program, where   letter   is a member of the Latin (English) alphabet:     a ──► z     and     A ──► Z.

You may want to mention what hardware architecture is being used, and if applicable, the operating system.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Idiomatically determine all the lowercase and uppercase letters step by step in the BASIC programming language

Source code in the basic programming language

10 FOR j = ASC("a") TO ASC("z")
20     PRINT CHR$(j);
30 NEXT j
40 PRINT
50 FOR j = ASC("A") TO ASC("Z")
60     PRINT CHR$(j);
70 NEXT j
80 END


for j = asc("a") to asc("z")
    print chr(j);
next j
print
for j= asc("A") to Asc("Z")
    print chr(j);
next j
end

10 FOR j = ASC("a") TO ASC("z")
20     PRINT CHR$(j);
30 NEXT j
40 PRINT
50 FOR j = ASC("A") TO ASC("Z")
60     PRINT CHR$(j);
70 NEXT j
80 END


10 FOR j = ASC("a") TO ASC("z")
20     PRINT CHR$(j);
30 NEXT j
40 PRINT
50 FOR j = ASC("A") TO ASC("Z")
60     PRINT CHR$(j);
70 NEXT j
80 END


10 CLS : REM  10 HOME for Applesoft BASIC
20 FOR J = ASC("a") TO ASC("z")
30     PRINT CHR$(J);
40 NEXT J
50 PRINT
60 FOR J = ASC("A") TO ASC("Z")
70     PRINT CHR$(J);
80 NEXT J
90 END


for j = asc("a") to asc("z")
    print chr$(j);
next j
print
for j = asc("A") to asc("Z")
    print chr$(j);
next j
end

FOR j = ORD("a"[1:1]) TO ORD("z"[1:1])
    PRINT CHR$(j);
NEXT j
PRINT
FOR j = ORD("A"[1:1]) to ORD("Z"[1:1])
    PRINT CHR$(j);
NEXT j
END


for j = asc("a") to asc("z")
    print chr$(j);
next j
print
for j= asc("A") to asc("Z")
    print chr$(j);
next j
end

You may also check:How to resolve the algorithm Averages/Pythagorean means step by step in the REXX programming language
You may also check:How to resolve the algorithm Memory allocation step by step in the Kotlin programming language
You may also check:How to resolve the algorithm Euler's constant 0.5772... step by step in the Rust programming language
You may also check:How to resolve the algorithm Jump anywhere step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Knight's tour step by step in the AutoHotkey programming language