Select Connection: INPUT[inlineListSuggester(optionQuery(#permanent_note), optionQuery(#literature_note), optionQuery(#fleeting_note)):connections]
DEFINITION
When two lexical grammar rules can both match a chunk of code that the scanner is looking at, whichever one matches the most characters wins.
For example, if we have a word orchid which can be mapped as an identifier or as the keyword or, the former wins. The same applies for <=, it will map to less equal, not to less.