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

Published on 12 May 2024 09:40 PM
#Quackery

How to resolve the algorithm Idiomatically determine all the lowercase and uppercase letters step by step in the Quackery 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 Quackery programming language

Source code in the quackery programming language

  [ dup upper != ] is islower ( c --> b )

  [ dup lower != ] is isupper ( c --> b )

    say "Lower case: " 
    127 times 
      [ i^ islower if [ i^ emit ] ]
    cr
    say "Upper case: " 
    127 times 
      [ i^ isupper if [ i^ emit ] ]

You may also check:How to resolve the algorithm Sorting algorithms/Counting sort step by step in the Perl programming language
You may also check:How to resolve the algorithm Strip a set of characters from a string step by step in the Groovy programming language
You may also check:How to resolve the algorithm Mutual recursion step by step in the Nim programming language
You may also check:How to resolve the algorithm JSON step by step in the Pascal programming language
You may also check:How to resolve the algorithm Arithmetic evaluation step by step in the XPL0 programming language