All compilers translate a text stream into a tree structure during parsing, so arguing that some language &quot;needs&quot; infix is saying that there is some tree structure out there that can&#x27;t be traversed depth-first rather than breadth-first.<p>That can only be true if your supposed &quot;tree&quot; actually contains loops. What language do you know of that generates cyclical parse structures?