GLR is an abbreviation for Generalized-LR, a parsing algorithm that generalizes LR parsing. Instead of rejecting LR parse tables with reduce/reduce or shift/reduce conflicts, the parser forks the stack and tries to parse the input according to the two possibilities represented by the conflict.
The idea for GLR parsing was first introduced by Masuru Tomita, but it was called GLR by Rekers.