Classification of simple finite-dim Lie algebras for char >=5 has been accomplished not so long time ago, and char p=2,3 is open problem.

I wonder what is known/expected for char p=2,3 ?

More vague and soft question is the following - look at some famous classification problems: simple finite-dim Lie algebras, simple finite groups, some other things classified by ADE... We see the following pattern: there are some series of objects and finite number of "sporadic" objects. I.e. it never happens that there is infinite number of examples which are not in "series". So classification of simple objects is simple (in some very informal sense).

The question: can we expect this in advance, without obtaining classification ? (What are other examples/counter examples of similar phenomenon ?).

For example can we expect/prove this for simple Lie algs for char =2,3 ? I.e. there will be some finite number of series and finite number of "sporadic" examples ?