mark recursive functions

Author: perazz

src/regex.f90

@@ -309,7 +309,7 @@ logical function matchcharclass(c,str) result(match)
 
     end function matchcharclass
 
-    logical function matchquestion(p, pattern, text, matchlength)
+    recursive logical function matchquestion(p, pattern, text, matchlength)
        type(regex_token), intent(in) :: p, pattern(:)
        character(len=*,kind=RCK), intent(in) :: text
        integer, intent(inout) :: matchlength
@@ -334,7 +334,7 @@ logical function matchquestion(p, pattern, text, matchlength)
 
     end function matchquestion
 
-    logical function matchstar(p, pattern, text, it0, matchlength)
+    recursive logical function matchstar(p, pattern, text, it0, matchlength)
        type(regex_token), intent(in) :: p, pattern(:)
        character(len=*,kind=RCK), intent(in) :: text
        integer, intent(in)    :: it0 ! starting point
@@ -371,7 +371,7 @@ logical function matchstar(p, pattern, text, it0, matchlength)
 
     end function matchstar
 
-    logical function matchplus(p, pattern, text, it0, matchlength)
+    recursive logical function matchplus(p, pattern, text, it0, matchlength)
        type(regex_token), intent(in) :: p, pattern(:)
        character(len=*,kind=RCK), intent(in) :: text
        integer, intent(in) :: it0
@@ -615,7 +615,7 @@ function print_pattern(pattern) result(msg)
     end function print_pattern
 
     ! Match a single pattern at the g
-    logical function pat_match(p, c) result(match)
+    recursive logical function pat_match(p, c) result(match)
        class(regex_token), intent(in) :: p
        character(kind=RCK), intent(in) :: c