Thanks for using Compiler Explorer
Sponsors
Jakt
C++
Ada
Algol68
Analysis
Android Java
Android Kotlin
Assembly
C
C3
Carbon
C with Coccinelle
C++ with Coccinelle
C++ (Circle)
CIRCT
Clean
CMake
CMakeScript
COBOL
C++ for OpenCL
MLIR
Cppx
Cppx-Blue
Cppx-Gold
Cpp2-cppfront
Crystal
C#
CUDA C++
D
Dart
Elixir
Erlang
Fortran
F#
GLSL
Go
Haskell
HLSL
Hook
Hylo
IL
ispc
Java
Julia
Kotlin
LLVM IR
LLVM MIR
Modula-2
Nim
Numba
Nix
Objective-C
Objective-C++
OCaml
Odin
OpenCL C
Pascal
Pony
PTX
Python
Racket
Ruby
Rust
Sail
Snowball
Scala
Slang
Solidity
Spice
SPIR-V
Swift
LLVM TableGen
Toit
TypeScript Native
V
Vala
Visual Basic
Vyper
WASM
Zig
Javascript
GIMPLE
Ygen
sway
pascal source #1
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Verbose demangling
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
madpascal trunk
x86-64 fpc (trunk)
x86-64 fpc 2.6.0
x86-64 fpc 2.6.2
x86-64 fpc 2.6.4
x86-64 fpc 3.0.2
x86-64 fpc 3.0.4
x86-64 fpc 3.2.0
x86-64 fpc 3.2.2
Options
Source code
program grosse_primzahlen; uses crt; var i, j, start, ende, jstop : qword; prim : boolean; begin clrscr; writeln; writeln('Berechnung grosser Primzahlen'); writeln('-----------------------------'); write('starten bei : ');readln(start); write('enden bei : ');readln(ende); i:=start; repeat prim:=true; inc(i); j:=1; jstop:=round(sqrt(i)); repeat inc(j); if i mod j = 0 then prim := false; until j>= jstop; if prim=true then writeln(i,' ist Primzahl'); until i= ende; end.
modula2 source #2
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Verbose demangling
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
x86-64 gcc gm2 (snapshot)
x86-64 gcc gm2 13.1
x86-64 gcc gm2 13.1 (assertions)
x86-64 gcc gm2 13.2
x86-64 gcc gm2 13.2 (assertions)
x86-64 gcc gm2 13.3
x86-64 gcc gm2 13.3 (assertions)
x86-64 gcc gm2 14.1
x86-64 gcc gm2 14.1 (assertions)
x86-64 gcc gm2 14.2
x86-64 gcc gm2 14.2 (assertions)
x86-64 gcc gm2 15.1
x86-64 gcc gm2 15.1 (assertions)
Options
Source code
MODULE BigPrimes; FROM STextIO IMPORT WriteLn, WriteString; FROM SLongWholeIO IMPORT ReadCard, WriteCard; IMPORT RealMath; CONST Round = RealMath.round; Sqrt = RealMath.sqrt; VAR Start, End, I, J, JStop: LONGCARD; Prim: BOOLEAN; BEGIN WriteLn; WriteString("calcualtion of big primes"); WriteLn; WriteString("-------------------------"); WriteLn; WriteString("enter start and end numbers: "); ReadCard(Start); ReadCard(End); I := Start; REPEAT Prim := TRUE; INC(I); J := 1; JStop := Round(Sqrt(VAL(REAL, I))); REPEAT INC(J); IF I MOD J = 0 THEN Prim := FALSE; END; UNTIL J >= JStop; IF Prim THEN WriteCard(I, 0); WriteString(" is a prime"); WriteLn; END; UNTIL I = End; END BigPrimes.
Become a Patron
Sponsor on GitHub
Donate via PayPal
Source on GitHub
Mailing list
Installed libraries
Wiki
Report an issue
How it works
Contact the author
CE on Mastodon
CE on Bluesky
About the author
Statistics
Changelog
Version tree