What follows after lexical analysis?
I’m working on a toy compiler (for some simple language like PL/0) and I have my lexer up and running. At this point I should start working on building the parse tree, but before I start I was wondering: How much information can one gather from just the string of tokens? Here’s what I gathered so far:
Constructing a Deterministic Finite State Automaton for a given Regex
I have a couple of exam questions for my compilers class and wanted to check if my solutions are correct.
Showing a grammar is ambiguous
I have the following question taken from a compilers course exam:
Constructing a Finite State Automaton
I have an exam question that I am unsure of the answer. The question is:
What are the challenges related to typing in writing a compiler for a dynamically typed language?
In this talk, Guido van Rossum is talking (27:30) about attempts to write a compiler for Python code, commenting on it saying:
Convert grammar into an LL(1) grammar which recognises the same language
I have the following sample question for a compilers exam and wanted to check my solution.
Convert grammar into an LL(1) grammar which recognises the same language
I have the following sample question for a compilers exam and wanted to check my solution.
Is Ken Thompson’s compiler hack still a threat?
Ken Thompson Hack (1984) Ken Thompson outlined a method for corrupting a compiler binary (and other compiled software, like a login script on a *nix system) in 1984. I was curious to know if modern compilation has addressed this security flaw or not. Short description: Re-write compiler code to contain 2 flaws: When compiling its […]
Online compilers and repls – not one big security hole?
There are plenty of compilers and REPL services on the web. For example: Fay ide.
Online compilers and repls – not one big security hole?
There are plenty of compilers and REPL services on the web. For example: Fay ide.