Learn more about computerscience with this collection
Understanding machine learning models
Improving data analysis and decision-making
How Google uses logic in machine learning
14
30 reads
MORE IDEAS ON THIS
The first step in most programming languages is lexing, or tokenizing. ‘Lex’ is short for lexical analysis, a very fancy word for splitting a bunch of text into tokens.
The word ‘tokenizer’ makes a lot more sense, but ‘lexer’ is so much fun to say that I use it anyway.
15
96 reads
Put simply, the action tree is the AST with context. That context is info such as what type a function returns, or that two places in which a variable is used are in fact using the same variable.
Because it needs to figure out and remember all this context, the code that g...
14
27 reads
Once we have the action tree, running the code is easy. Each action node has a function ‘execute’ which takes some input, does whatever the action should (including possibly calling sub action) and returns the action’s output. This is the interpreter in action.
14
46 reads
The parser adds structure to to the ordered list of tokens the lexer produces. To stop ambiguities, the parser must take into account parenthesis and the order of operations.
Simply parsing operators isn’t terribly difficult, but as more language constructs get added, pars...
14
34 reads
The predominant parsing library is Bison. Bison works a lot like Flex. You write a file in a custom format that stores the grammar information, then Bison uses that to generate a C program that will do your parsing. I did not choose to use Bison.
14
33 reads
A token is a small unit of a language.
A token might be a variable or function name (AKA an identifier), an operator or a number.
14
62 reads
The parser turns a list of tokens into a tree of nodes. A tree used for storing this type of data is known as an Abstract Syntax Tree, or AST.
At least in Pinecone, the AST does not have any info about types or which identifiers are which. It is simply structured tokens.
14
41 reads
If you are writing an interpreted language, it makes a lot of sense to write it in a compiled one (like C, C++ or swift).
If you plan to compile, a slower language (like python or Javascript) is more acceptable.
14
166 reads
A programming language is generally structured as a pipeline. That is, it has several stages.
Each stage has data formatted in a specific, well defined way. It also has functions to transform data from each stage to the next.
15
124 reads
There are two major types of languages: compiled and interpreted:
16
124 reads
CURATED FROM
Related collections
More like this
Switching tasks and context is difficult. You cannot be efficient if you run from meeting to meeting. If you want to avoid wasting time, add buffer time between each meeting.
For every 45 - 60 minutes you spend in a meeting, take 15 minutes to process, reflect, and prioritize.
Read & Learn
20x Faster
without
deepstash
with
deepstash
with
deepstash
Access to 200,000+ ideas
—
Access to the mobile app
—
Unlimited idea saving & library
—
—
Unlimited history
—
—
Unlimited listening to ideas
—
—
Downloading & offline access
—
—
Personalized recommendations
—
—
Supercharge your mind with one idea per day
Enter your email and spend 1 minute every day to learn something new.
I agree to receive email updates