high level programming language and compiler targeting 6502 machines such as the C-64 and CommanderX16
Go to file
2019-07-10 01:52:04 +02:00
.idea restructuring of the AST package 2019-07-08 13:33:31 +02:00
compiler optimize redundant typecasts more 2019-07-10 01:52:04 +02:00
docs docs about 'when' statement 2019-07-10 00:45:53 +02:00
examples when statement extended with multiple choice values 2019-07-10 00:25:21 +02:00
gradle/wrapper gradle wrapper 2019-01-29 12:06:10 +01:00
old_scripts new build scripts 2019-04-20 00:50:15 +02:00
parser when statement extended with multiple choice values 2019-07-10 00:25:21 +02:00
.gitignore intellij idea config 2019-04-20 01:18:47 +02:00
.travis.yml travis ci 2019-06-21 23:22:34 +02:00
clean.sh simple cleaup script 2019-06-23 14:10:50 +02:00
create_compiler_jar.sh new build scripts 2019-04-20 00:50:15 +02:00
gradle.properties removed kotlin.reflection dependency 2019-07-09 08:27:47 +02:00
gradlew gradle wrapper 2019-01-29 12:06:10 +01:00
gradlew.bat gradle wrapper 2019-01-29 12:06:10 +01:00
LICENSE rethinking some aspects and rewriting text a bit 2018-07-01 23:24:32 +02:00
p8compile.cmd scripts 2019-07-02 04:39:53 +02:00
p8compile.sh scripts 2019-07-02 04:39:53 +02:00
p8vm.cmd script fixes 2019-07-09 05:09:13 +02:00
p8vm.sh script fixes 2019-07-09 05:09:13 +02:00
README.md ver 2019-07-10 00:50:18 +02:00
settings.gradle initial version of compiler and parser gradle module 2019-01-29 12:08:21 +01:00

saythanks Build Status

Prog8 - Structured Programming Language for 8-bit 6502/6510 microprocessors

Written by Irmen de Jong (irmen@razorvine.net)

Software license: GNU GPL 3.0, see file LICENSE

This is a structured programming language for the 8-bit 6502/6510 microprocessor from the late 1970's and 1980's as used in many home computers from that era. It is a medium to low level programming language, which aims to provide many conveniences over raw assembly code (even when using a macro assembler):

  • reduction of source code length
  • easier program understanding (because it's higher level, and way more compact)
  • modularity, symbol scoping, subroutines
  • subroutines have enforced input- and output parameter definitions
  • various data types other than just bytes (16-bit words, floats, strings, 16-bit register pairs)
  • automatic variable allocations, automatic string variables and string sharing
  • constant folding in expressions (compile-time evaluation)
  • conditional branches
  • when statement to provide a 'jump table' alternative to if/elseif chains
  • automatic type conversions
  • floating point operations (uses the C64 Basic ROM routines for this)
  • abstracting away low level aspects such as ZeroPage handling, program startup, explicit memory addresses
  • various code optimizations (code structure, logical and numerical expressions, unused code removal...)

Rapid edit-compile-run-debug cycle:

  • use modern PC to work on
  • quick compilation times (less than 1 second)
  • option to automatically run the program in the Vice emulator
  • breakpoints, that let the Vice emulator drop into the monitor if execution hits them
  • source code labels automatically loaded in Vice emulator so it can show them in disassembly

It is mainly targeted at the Commodore-64 machine at this time. Contributions to add support for other 8-bit (or other?!) machines are welcome.

Documentation is online at https://prog8.readthedocs.io/

Required tools:

64tass - cross assembler. Install this on your shell path. A recent .exe version of this tool for Windows can be obtained from my clone of this project. For other platforms it is very easy to compile it yourself (make ; make install).

A Java runtime (jre or jdk), version 8 or newer is required to run a prepackaged version of the compiler. If you want to build it from source, you'll need a Java SDK + Kotlin 1.3.x SDK (or for instance, IntelliJ IDEA with the Kotlin plugin).

It's handy to have a C-64 emulator or a real C-64 to run the programs on. The compiler assumes the presence of the Vice emulator

Example code

This code calculates prime numbers using the Sieve of Eratosthenes algorithm::

%import c64utils
%zeropage basicsafe

~ main {

    ubyte[256] sieve
    ubyte candidate_prime = 2

    sub start() {
        memset(sieve, 256, false)

        c64scr.print("prime numbers up to 255:\n\n")
        ubyte amount=0
        while true {
            ubyte prime = find_next_prime()
            if prime==0
                break
            c64scr.print_ub(prime)
            c64scr.print(", ")
            amount++
        }
        c64.CHROUT('\n')
        c64scr.print("number of primes (expected 54): ")
        c64scr.print_ub(amount)
        c64.CHROUT('\n')
    }


    sub find_next_prime() -> ubyte {

        while sieve[candidate_prime] {
            candidate_prime++
            if candidate_prime==0
                return 0
        }

        sieve[candidate_prime] = true
        uword multiple = candidate_prime
        while multiple < len(sieve) {
            sieve[lsb(multiple)] = true
            multiple += candidate_prime
        }
        return candidate_prime
    }
}

when compiled an ran on a C-64 you'll get:

c64 screen

One of the included examples (wizzine.p8) animates a bunch of sprite balloons and looks like this:

wizzine screen

Another example (cube3d-sprites.p8) draws the vertices of a rotating 3d cube:

cube3d screen

If you want to play a video game, a fully working Tetris clone is included in the examples:

tehtriz_screen