This is to answer the question that the OP asked in the comment, about convergence of the Gauss-Laguerre quadrature when $f(x)=x\log x$.
Uspensky has shown that the Gauss-Laguerre quadrature rule for computing integrals of the form
$$\int_{0}^{\infty}x^{\alpha}e^{-x}f(x)dx$$
converges, as $n\to\infty$, if $f$ satisfies the following growth at infinity,
$$|f(x)|\leq c x^{-\alpha-1-\rho}e^{x},\qquad|x|\text{ large},$$
for some $\rho>0$, see
J. V. Uspenksy, On the convergence of quadrature formulas related to
an infinite interval, Trans. Amer. Math. Soc. 30 (1928), 542-559.
Thus, the G-L quadrature indeed converges in the case of $f(x)=x\log x$. Actually, even the rate of convergence can be estimated.
The case where $f(x)$ is not smooth at the origin, as for $x\log x$, was studied in
Mastroianni G., Monegato G., Convergence of product integration rules
over $(0,\infty)$ for functions with weak singularities at the origin.
Math. Comp. 64, (1995), 237-249.
The following is proved. For $q\geq p\geq0$, let
$$C _ { p } ^ { q } [ 0,\infty ) : = \{ f \in C ^ { p } [ 0,\infty ) \cap C ^ { q } ( 0,\infty ),~x ^ { i } f ^ { ( p + i ) } ( x ) \in C [ 0,\infty ),~i=1,\ldots,q-p\}.$$
Then, the remainder term $R_{n}(f)$ of the Gauss-Laguerre quadrature satisfies
$$
|R_{n}(f)|=\begin{cases}
\mathcal O(n^{-q/2}) E_{n-p-1}(\Phi^{(q)},e^{-x/2}) & \text{if }q\leq 2p+1, \\
\mathcal O(n^{-p-1}\log n) E_{n-p-1}(\Phi^{(q)},e^{-x/2}) & \text{if }q= 2p+2, \\
\mathcal O(n^{-p-1}) E_{n-p-1}(\Phi^{(q)},e^{-x/2}) & \text{if }q\geq 2p+3,
\end{cases}
$$
where $ \Phi ( x ) : = x ^ { q - p } f ( x ) \in C ^ { q } [ 0,\infty ) $, and $ E _ { n } ( f ; w ) : = \operatorname{inf} _ { p _ { n } } \| w \left[ f - p _ { n } \right] \| _ { \infty ,[ 0,\infty ) } $.
Hence, for the function $f(x)=x\log x\in C_{0}^{3}[0,\infty)$,
$$\Phi(x)=x^{4}\log x,\qquad\Phi^{(3)}(x)=24x\log x+26x,$$
and thus
$$|R_{n}(f)|=\mathcal O(n^{-1})E_{n-1}(x\log x, e^{-x/2}).$$
Since, it is also known that $E_{n-1}(x\log x, e^{-x/2})=\mathcal O(n^{-1})$ for $n$ large, one finally gets for the function $f(x)=x\log x$,
$$|R_{n}(f)|=\mathcal O(n^{-2}), \qquad n\text{ large}.$$