Code Monkey home page Code Monkey logo

battledev's Introduction

👨‍💻 { 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.

battledev's People

Contributors

gitcordier avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.