https://lotusspring.substack.com
This code was written without the intention of being publicly shared. Not much effort was put into beautification or anything like that, one big file that does it all! Some effort is requried on your part to make this compile.
I heavily dislike python and consider the code wasteful slop. I have very little python experience, so there are likely much better ways of writing the python portion. Exercise caution!
| #include <stdint.h> | |
| #include <stdlib.h> | |
| #include <stdbool.h> | |
| #include <windows.h> | |
| #pragma comment( lib, "user32.lib" ) | |
| #pragma comment( lib, "gdi32.lib" ) | |
| #define SCRW 640 | |
| #define SCRH 480 |
| // This is for the Zig 0.15. | |
| // See https://gist.github.com/karlseguin/c6bea5b35e4e8d26af6f81c22cb5d76b/1f317ebc9cd09bc50fd5591d09c34255e15d1d85 | |
| // for a version that workson Zig 0.14.1. | |
| // in your build.zig, you can specify a custom test runner: | |
| // const tests = b.addTest(.{ | |
| // .root_module = $MODULE_BEING_TESTED, | |
| // .test_runner = .{ .path = b.path("test_runner.zig"), .mode = .simple }, | |
| // }); |
Majority of the resources I used to build Tucan, my toy optimizing compiler in Rust. This list is not complete but most of the things listed here are things I really read through and used.
This git include a list of programs, tools, engines and libraries free and open source intended to make videogames.
NOTE: This gist is a support material for the talk "Open Source and Videogames" given by me, Ramon Santamaria, on October 26th 2021 in Canòdrom, Barcelona. All the materials listed here were explained in detail in a +2 hours talk.
| // download glfw3 from https://www.glfw.org/download and then compile: | |
| // cl.exe -O2 q1.c -Iinclude -link opengl32.lib glu32.lib lib-vc2019\glfw3dll.lib | |
| #define _CRT_SECURE_NO_DEPRECATE | |
| #include <stdint.h> | |
| #include <string.h> | |
| #include <stdio.h> | |
| #include <math.h> | |
| #include <assert.h> |
| // Copyright (c) 2021 Francesco Mazzoli <f@mazzo.li> | |
| // | |
| // Permission to use, copy, modify, and distribute this software for any | |
| // purpose with or without fee is hereby granted, provided that the above | |
| // copyright notice and this permission notice appear in all copies. | |
| // | |
| // THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES | |
| // WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF | |
| // MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR | |
| // ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
A traditional table-based DFA implementation looks like this:
uint8_t table[NUM_STATES][256]
uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
for (const uint8_t *s = start; s != end; s++)
state = table[state][*s];
return state;
}
| // example how to set up D3D11 rendering on Windows in C | |
| #define COBJMACROS | |
| #define WIN32_LEAN_AND_MEAN | |
| #include <windows.h> | |
| #include <d3d11.h> | |
| #include <dxgi1_3.h> | |
| #include <d3dcompiler.h> | |
| #include <dxgidebug.h> |
| const std = @import("std"); | |
| const Allocator = std.mem.Allocator; | |
| pub const Error = error{ | |
| EndOfStream, | |
| Utf8InvalidStartByte, | |
| } || std.fs.File.ReadError || std.fs.File.SeekError || std.mem.Allocator.Error; | |
| pub fn Parser(comptime Value: type, comptime Reader: type) type { | |
| return struct { |