ABAP Runtime Errors

REGEX_TOO_COMPLEX SAP ABAP Runtime Error regex too complex







REGEX_TOO_COMPLEX is an ABAP runtime error which you may come across when using or developing within an SAP system. See below for the standard details explaining what it means and how you can avoid or fix this runtime error.

Short Dump Classification: A - ABAP Programming Error

You can view further information about a runtme error by using transaction code ST22 which will show you this and all runtime erros that have happen in your SAP system.

Also check out the Comments section below to view or add related contributions and example screen shots.


REGEX_TOO_COMPLEX ABAP Runtime Error

Check whether the regular expression can be simplified.

Please see abap error for more details about the possible cause of this runtime error and how it could be avoided.

Please see search hints for more details about the possible cause of this runtime error and how it could be avoided.

Please see send to sap for more details about the possible cause of this runtime error and how it could be avoided.

The specified regular expression is too complex. Check whether you can simplify the regular expression. In particular, using many character classes [...] and alternatives ... | ..., as well as the IGNORING CASE addition, increase the complexity.

Note that the used regular expression will not necessarily result in a termination for other search texts. Nevertheless, it is recommended that you do not use this expression.

Please see abap error for more details about the possible cause of this runtime error and how it could be avoided.

The search with the regular expression <runtime parameter> was cancelled.

Due to the relatively high level of complexity of the expression, it is not possible to determine the hits according to the leftmost-longest rule for the current seach text.

Please see abap error for more details about the possible cause of this runtime error and how it could be avoided.

The specified regulöar expression <runtime parameter> is too complex. Therefore, it is not possible to determine the matches in the search text accroding to the leftmost-longest rule.