Skip to content
View gitcordier's full-sized avatar
💭
Writing MarkdownToLaTeX
💭
Writing MarkdownToLaTeX

Block or report gitcordier

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
gitcordier/README.md

👨‍💻 { Hi there !

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 by
✏️ The last input character,
📝 A bounded memory that 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 Plus, as explained in Specifying Systems.
The parsing state machine was first written in TLA Plus, 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… :rowboat: 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.

▶️ Functional Analysis 7 ⭐

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 9 ⭐

Code from Bellingcat's guide.

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.

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.

Pinned Loading

  1. MarkdownToLaTeX MarkdownToLaTeX Public

    Markdown to LaTeX

    Python 1

  2. FunctionalAnalysis FunctionalAnalysis Public

    Solutions to some exercises from Walter Rudin's Functional Analysis

    TeX 15 3

  3. bellingcat bellingcat Public

    Code from Bellingcat's guide

    Python 11 1

  4. TheChemicalBrowsers TheChemicalBrowsers Public

    Given a chemical formula, find how many H, He, Li, Be, B, C, N, ... are involved. Iterative algorithm, not the naive one!

    Jupyter Notebook 1