Just BASIC

Presentation

Just BASIC , is an alternative of the computer programming language BASIC (a structured version of BasicA).

The Environnement of development integrated Just BASIC is a Logiciel owner of Shoptalk Systems, integrating amongst other things a editor and a Compilateur BASIC.

The compiler makes it possible to generate achievable .exe 32 bits using a compiler.

This program functions perfectly with Windows XP in its version 32 and 64 bits, because it is an application 32 bits.

Just BASIC is a version reduced and free of Liberty BASIC which allows the creation of complete and autonomous programs however.

Just BASIC and Liberty BASIC being both of the compilers 32 bits, they have the advantage of being faster than QBasic which they succeeded.

Features

Functions on all the versions of Windows
completely free Version
Livré with a crowd of little programs
an active community on Internet to help you
Éditeur of code with coloring Syntaxique
visual Outil to create your windows Windows
Livré with an effective tool of debuggage
Création of Functions and of under routines

Hello World

PRINT " Hello World"

Sample program under Just BASIC

Here a program coded in Just BASIC.

Development of (a+b)^n:

“TriPascal.bas: Black Templar - 5/15/06” “This little program makes it possible to know the coefficients of the formula developed: (+ b)^n has. ” “It uses the algorithm of the triangle of Pascal. ” '' '' “1 1 1+ 1 (has + b)^1 = 1*a + 1*b” “=” “1 2 1 1 2 1 (has + b)^2 = 1*a^2 + 2*a*b + 1*b^2” '' “1 3 3 1 1 3+ 3 1 (has + b)^3 = 1*a^3 + 3*a^2*b + 3*a*b^2 + 1*b^3” “=” “1 4 6 4 1 1 4 6 4 1 (has + b)^4 = 1*a^4 + 4*a^3*b + 6*a^2*b^2 +…” '' “1 5 10 10 5 1 1 5 10 10 5 1 (has + b)^5 = 1*a^5 + 5*a^4*b + 10*a^3*b^2 +…” '' “You will be able to use it in the theorem of the binomial theorem. Indeed, the coefficients are” “makes of them the values of the combinations in the formula: ” '' “N p” “nap (C * a^ (p) * b^ (m-p))” “p=0 '' print " (has + b)^n with N > 0" input " N = " ; N yew N < 1 gold N <> int (N) then cls goto end yew dim list (2) list (1) = 1 list (2) = 1 coeff = 2 for bcl = 2 to N dim liste1 (coeff) for Z = 1 to coeff liste1 (Z) = list (Z) next coeff = coeff + 1 dim list (coeff) list (1) = 1 for Nb = 2 to coeff-1 list (Nb) = liste1 (Nb-1) + liste1 (Nb) next list (coeff) = 1 next cls print " (+ b)^" has; ; N; " = " ; for Z = 1 to coeff yew lists (Z) <> 1 then print list (Z); " *" ; print " (" ; yew coeff - Z <> 0 then print " a^" ; coeff - Z; yew coeff - Z <> 0 and Z - 1 <> 0 then print " *" ; yew Z - 1 <> 0 then print " b^" ; Z - 1; print ")" ; yew Z <> coeff then print " + " ; next end

This script is obviously only one outline of the language.

See too

QBASIC

External bonds

http://lbasic.fr/forum/
http://lbasic.fr/
http://www.coolprog.com/

http://www.justbasic.com/
http://justbasic.conforums.com/

Random links: