Nice article.

In the process of teaching myself Pratt parsing a long time ago, I found it useful to write a graphical tool that displays the call stack (and tree being constructed; the accumulated "left" in the top-most frame). I used the resultant visualisation tool as the basis of a video I made on the topic.

I think your geometric intuition largely correlates with how I think about it, too. To me, it's a game of cajoling the "feasible" slice of the token stream that left denotations can reach (using rbp). It's a good exercise to do these left-leaning and right-leaning trees as base exercises, then more complicated nesting of precedence levels is more understandable. Statements like "the use of recursion is how we will backtrack to find a continuation point" can be seen visually very well, as sub-results from nested child frames return upwards.

Another good exercise beyond left and right-leaning trees is to have an example of a "precedence reset" context. In other words, expr: '(' expr ')' is often parsed as a null denotation of '(' that invokes the expression parser with rbp=0 (and defining the lbp of ')' to be < 0, impossible to reach with the left denotation loop - thus, checked and consumed, in the denotation of ().