The Chebyshev collocation method (ChC) implemented as Chebfun is used in order to solve a class of second order one-dimensional singular and genuinely nonlinear boundary value problems. Efforts to solve these problems with conventional ChC have generally failed, and the outcomes obtained by finite differences or finite elements are seldom satisfactory. We try to fix this situation using the new Chebfun programming environment. However, for toughest problems we have to loosen the default Chebfun tolerance in Newton's solver as the ChC runs into trouble with ill-conditioning of the spectral differentiation matrices. Although in such cases the convergence is not quadratic the Newton updates decrease monotonically. This fact, along with the decreasing behaviour of Chebyshev coefficients of solutions, suggests that the outcomes are trustworthy, i.e., the collocation method has exponential (geometric) rate of convergence or at least an algebraic rate. We consider first a set of problems that have exact solutions or prime integrals and then another set of benchmark problems that do not possess these properties. Actually, for each test problem carried out we have determined how Chebfun solution converges, its length, the accuracy of the Newton method and especially how well the numerical results overlap with the analytical ones (existence and uniqueness).