>Does anybody know of a concrete example of an LALR(1)-conflict in an existing>(or hypothetical but semantically meaningful) programming language grammar>which is *exactly* LALR(1), i.e. the conflict is solved by moving to LR(1)?

This grammar is LR(1) but not LALR(1):

%term a b c d
%%
S: A a | b A c | B c | b B a
A: d
B: d
%%

There is a reduce/reduce conflict on rule "A -> d" and rule "B -> d" on
terminals a and c.