|- Crucial conversations can be handled well by dialogues. A dialogue is defined as free flow of information between individuals. A dialogue, if goes well, produces what is called a Shared Pool of Meaning. When individuals attend to a dialogue effectively, they voice their honest opinions. Because each person brings different interpretations to the same information, these interpretations, when debated,... »
I am reading Kerry Patterson et. al’s book called Crucial Conversations: Tools for Talking When Stakes Are High . This will be a series of notes on this book where I jot down my thoughts. Crucial conversation is defined as a conversation where: opinions vary Stakes are high Emotions run strongly Most couples, when asked why they broke up, often... »
Lately I have been involved with a new project whose output is a cross-platform mobile application. I choose Flutter as the framework, and consequently Dart as the front-end language. However, around this time I saw this awesome [series] about Flutter TDD Clean Architecture. It is a a really well-constructed course in my opinion. I have definitely drawn inspiration from this... »
In the previous post, I proved the Orbit-Stabilizer Theorem which states that the number of elements in an orbit of a is equal to the number of left cosets of the stabilizer of a. Burnside’s Lemma Let’s us review the Lemma once again: Where A/G is the set of orbits, and ** A/G ** is the cardinality of this set. Ag is the... »
Problem: Given a 3 by 3 grid, with 5 colors. How many different ways to color the grid, given that two configurations are considered the same if they can be reached through rotations ( 0, 90, 180, 270 degrees )? This problem was given in my Number Theory course. Somehow when I searched for the solution, I stumbled upon Group... »
Bottom-up parsing Bottom-up parser constructs the parse tree from the leaf towards the root. Why would we want to attempt to build this way ? Top-down parser uses one lookahead to choose immediately the right production to expand the parse tree. This seems efficient, and it is. But there the class of language that LL(1) parser can parse sucessfully is... »
Introduction Parsing is what happens after scanning the input stream and recognize words and their syntatic categories. The parser sees this stream of words and determine wether it fits a predefined grammar structure. Formally, for a string s and a grammar G, the parser tries to build a constructive proof that s can be derived in G - a process called parsing. 1) Regular expression’s... »
We have discussed about the theories of how a scaner should work in this post. Now move on to the implementation. Usually we have tools to automate implementation - scanner generators, with which you can specify the regular expression for each syntatic cateogry and it will handle everything. The generator constructs an NFA for each RE, create a corresponding DFA,... »
Disclaimer: This post is based entirely on the content of the book “ Engineering a compiler 2nd edition by Cooper and Toczon “. Some clarifications as well as simplifications have been made in the attempt to understand the material. Scanner takes a string of words as input and produces string of words of the output language. The scanner touches every... »
Concurrency control Imagine two users trying to access an employee table in the company’s database. One is requesting the total salary of the employees in order to transfer the money into their bank accounts. The other, upon receiving an email from the boss saying that he was impressed by John and decides to give him a raise, goes on modifying... »