▶️ Functional Analysis 16 ⭐️
Some solutions to Rudin's Functional Analysis. It's been a long time I haven't added new content. I really should but proofreading takes time… Rewriting is ongoing.
✅ Bellingcat 11 ⭐️
Code from Bellingcat's guide.
I am currently working on MarkdownToLaTeX, a Markdown-to-LaTeX parser you can pip -install.
The MarkdownToLaTeX parsing implements a state machine of which steps are decided according to the last input character. A bounded memory stores the necessary context.
The state machine source code is here. Markdown parsing and LaTeX document structuring are combined here.
MarkdownToLaTeX started as a toy project to which I could apply TLA + as explained in Specifying Systems. The parsing state machine was first written in TLA +, next in Python.
A compiled-from-code documentation and a mathsheet are available as well. The first chapter of the mathsheet is about formal specification and my very own story with the topic. I am always eager to learn, so feel free to give me a feedback!
This is an ongoing process… 🚣 but I try as hard as I can to keep up the pace.
▶️ tlaplus
This repository is dedicated to TLA + specifications. Currently, you may find here the specification of a reversible hoist, invented by the Renaissance architect Brunelleschi. Relevant historical note and pictures available at http://bdml.stanford.edu/Main/BrunelleschiNotes.
Given a chemical formula represented by a string, the parser counts the number of atoms of each element contained in the molecule then returns the result as a dictionary.
The trick is: Reading formulas from right to left makes the algorithm pretty straightforward.
Written for a job interview: A Reverse Polish Notation calculator. In other words, you can think of it as a stack-based process: First, push numbers in the stack, next compute then save the result as tail of the stack.
✅ ReversePolishNotationParser 1 ⭐️
Another reverse polish parser, written for a previous job process.
The special case means quadratic complexity. I like this problem, since getting a clean algorithm was a little bit tricky, but I could make it. Found the problem in a coding contest.
Given a workshop (at this time, it was https://www.parisfintechforum.com), the script gets all "featured" participants websites (Source: https://www.parisfintechforum.com/PFF2018/participants). you can see this code as a template: I assume that the code can be easily reused and applied to other websites.