Prime Checker - Bcpl Typing CST Test
Loading…
Prime Checker — Bcpl Code
Checks if numbers are prime.
LET nums = [7,10,13]
LET n=0
FOR n IN nums DO
LET isPrime = 1
LET i=2
WHILE i<n DO
IF n MOD i = 0 THEN isPrime = 0 END
i = i + 1
OD
IF isPrime THEN WRITEF("%N is Prime\n", n) ELSE WRITEF("%N is Not Prime\n", n) END
ODBcpl Language Guide
BCPL (Basic Combined Programming Language) is a minimalist, typeless systems programming language designed for writing compilers, operating systems, and early software infrastructure.
Primary Use Cases
- ▸Compiler and interpreter development
- ▸Operating system prototyping
- ▸Low-level systems programming
- ▸Teaching early programming language design
- ▸Legacy software and historical research
Notable Features
- ▸Typeless word-oriented language
- ▸Simple and minimal syntax
- ▸Supports arrays, pointers, and strings
- ▸Early example of structured programming
- ▸Highly portable across hardware platforms
Origin & Creator
Developed by Martin Richards in 1966 at the University of Cambridge, initially as a tool for writing compilers.
Industrial Note
BCPL was used in early operating systems development, compilers, and embedded systems, but today it is mainly of historical and academic interest.