[nilesh]

Discuss about bcpl basic combined programming language here. Welcome to Courses.ind.in and this page is for bcpl basic combined programming language discussion. If you are looking for information on bcpl basic combined programming language then ask your question is as much details as possible in the “Reply” box provided below. The more detailed your question will be, the more easy will it be for our experts to answers your query. And if you have any updated or latest information on bcpl basic combined programming language, then please share you knowledge with our experts in the “Reply” box below. Your reply will be published here and your knowledge can help many people. Thanks for stopping by at Courses.ind.in. Please visit again.

Hi buddy here I have come to get info related to BCPL ("Basic Combined Programming Language") , so would you plz tell me about the same ??

[Vishal Kotkar]

As you want here I am telling BCPL (Basic Combined Programming Language) is a procedural, imperative, and structured computer programming language designed by Martin Richards of the University of Cambridge in 1966.

It was the first brace programming language, and the braces survived the syntactical changes and have become a common means of denoting program source code statements. In practice, on limited keyboards of the day, source programs often used the sequences $( and $) in place of the symbols { and }. The single-line // comments of BCPL, which were not adopted by C, reappeared in C++ and later in C99.

Example of BCPL (Basic Combined Programming Language)
These complete and compilable examples are from Martin Richards’ BCPL distribution.

Print factorials:
GET "LIBHDR"

LET START() = VALOF $(
FOR I = 1 TO 5 DO
WRITEF("%N! = %I4*N", I, FACT(I))
RESULTIS 0
$)

AND FACT(N) = N = 0 -> 1, N * FACT(N - 1)

Count solutions to the N queens problem:
GET "LIBHDR"

GLOBAL $(
COUNT: 200
ALL: 201
$)

LET TRY(LD, ROW, RD) BE
TEST ROW = ALL THEN
COUNT := COUNT + 1
ELSE $(
LET POSS = ALL & ~(LD | ROW | RD)
UNTIL POSS = 0 DO $(
LET P = POSS & -POSS
POSS := POSS - P
TRY(LD + P << 1, ROW + P, RD + P >> 1)
$)
$)

LET START() = VALOF $(
ALL := 1
FOR I = 1 TO 12 DO $(
COUNT := 0
TRY(0, 0, 0)
WRITEF("%I2-QUEENS PROBLEM HAS %I5 SOLUTIONS*N", I, COUNT)
ALL := 2 * ALL + 1
$)
RESULTIS 0
$)