I find this likely and unlikely an interesting idea, because optimizing branches usually results in very unreadable code. For example, as was discussed here, if this is implicit by the ordering, this means that if you have the following code:
if A then
...
else if B then
...
else if C then
...
And it turns out that the last branch is the most likely one, this would needed to be rewritten to:
if not A and not B and C then
...
else if A then
...
else if B then
...
Which just made the code much more complicated to understand. In fact, reordering of an if-then-else chain can quadratically increase the complexity of each branching condition.
But on the other hand, more verbose is not necessarily better readable either, and adding something like "likely" to a branch, makes it at least slightly less readable.
So the question that I am asking myself is not what way of optimizing this is better, reordering or a keyword, because there with the exponential complexity increase a keyword would win hands down, but rather if this is needed in the first place.
C++ is designed to be as optimizable as possible, all features are designed to be "near-zero-cost" abstractions, as they call it, so having such keywords to enable the optimizer to better consider more likely paths makes sense in that context.
BUT: Pascal is not built in the same way. Pascals feature set is not built around optimizability. When you want to write really optimized Pascal code, you already must exclude a lot of language features which are quite essential to what is considered "good" Pascal code, such as Classes instead of Objects, managed types like Arrays and Strings, Try-Finally blocks, etc.
So I think when considering new features to be implemented, the goal should not be to allow for micro optimizations, because this is not the core value that Pascal brings to the table. This effort if anything should be focused on adding features that ease development and make it easier to write simple code that performs complex tasks.
And always to keep in mind, the most used languages are languages like Python, JavaScript, Java, C#, etc. and while their optimizations are pretty amazing for what they are, simply the fact that they are dynamic bytecode languages makes them comparatively extremely slow.
So it's not optimizations and program performance that drive language usage, most people don't care about that when choosing a language to use (as long as it is "fast enough"). It's simply a question on how much effort does it take to solve my problem in a satisfying manner