DEV Community

Regex Domination to Become an Algorithms Wizard (Basic)

Mauro Bono on July 30, 2019

In this article I want to take a close look at one of the most weird argument I found while learning to code: Regular Expressions. Any time I work ...

Read full post

Johannes Vollmer • Jul 30 '19

Thanks for this detailed guide! If any of you want to internalize what you have just read, you could play around with my latest project: Regex Nodes (shameless plug!). Regular expressions will visually be broken down to its components, which makes it easy to digest.

Mauro Bono • Jul 30 '19

I am going to check it. Thanks for your kind answer, hope you enjoyed my post 😉

Alex Gordon • Jul 31 '19

Not mobile friendly but great job

Mauro Bono • Jul 31 '19

Thanks for your comment, but I did not understand if you're talking about the article itself or the regex app by Johannes when you say "not mobile friendly". If you're talking about the article, please tell me where I can fix it and make it better (if possible).

Johannes Vollmer • Jul 31 '19 • Edited

Sorry for the confusion, he is talking about the app. Your article is fine, don't worry :)

sahaj ranipa • Jul 31 '19

Please make an article about finite autometa which can be used to match and recognize string patterns it will surely help us.

Mauro Bono • Jul 31 '19

Thanks sahaj, but I really know nothing about finite automata. If you try to explain me better I'm going to check and find out if I can help you. Have a nice day!

sahaj ranipa • Jul 31 '19 • Edited

Sir I studied finite autometa in my computer science BE degree but it was always difficult to fully grasp them for more information you can refer TOC book by John c.martin it has very interesting concepts like DFA,NFA and Turing machines etc.

Finite autometa are nothing but state wise pictorial representation of regex which has starting state and final state which have intermediate states in between them. By giving some inputs to those intermediate states we can move from one state to another state and finally we will get through the final state. Which means the string patterns which we want to recognize is accepted.there are two types of finite autometa one is definite finite autometa and second one is non definite finite autometa

Mauro Bono • Jul 31 '19

Thanks. As soon as possible I'm going to check! Bye!

sahaj ranipa • Jul 31 '19

Have a good day sir and sir can you suggest me a good JavaScript books and also for angular,Express and mongodb books.

Mauro Bono • Jul 31 '19 • Edited

You are looking for a lot of books! 😃
I can surely suggest a good Javascript intro book from SitePoint. It is called "Javascript: From Novice to Ninja". Pairing it with FreeCodeCamp curriculum will be a good shot to learn Javascript.
To learn Node, Express and MongoDB (even though I know just the basic of this last one) I used MDN Express Tutorial. You will learn it by building a library project. Good also for your portfolio.
For Angular I cannot help. Never tried. But surely someone here could help you. Bye!