Recursive Descent Parser is a top-down parser where every non-terminal in the BNF grammar is a subroutine. The parser works by recursively calling each subroutine to construct the parsed output. It’s not the only algorithm to implement a parser, but it’s one of the most simple ones that are very easy to understand and implement.
Source: Parsing/Recursive Descent Parser.
when using
Array.reduce()for complex operations, we tend to resort to using side effects (e.g. defining aletvariable or an object out of scope. and modify them while iterating).Here's an easy way to keep your reduce functions pure by using the aggregator as a state.
Source: Pure Reduce Functions - Use Aggregator As A State, an article by Miki Stanger.
In my personal projects, I’ve never imposed any order on my CSS declarations. Or rather: I’ve ordered my declarations, just not mindfully. To Eric’s point, it’s mostly been: “arbitrarily adding properties everywhere until it looks right in the browser.” That’s me.
After reading Eric’s article, I’m feeling convinced to go alphabetical.
Source: Ordering CSS Declarations, an article by Jim Nielsen.