-- ========================================================================
exec clearobj 'DFA_simulate', 1
go
create proc DFA_simulate
@str nvarchar(100), @match bit output
with encryption
as
declare @i int, @current_state nvarchar(100), @next_state nvarchar(100)
select @current_state = state from DFA_states where code = 'A' -- initial state
select @next_state = '', @match = 1
select @i = 1
while @i <= len(@str)
begin
select @next_state = ''
select @next_state = to_state from DFA_trans_table where from_state = @current_state and input = substring(@str, @i, 1)
if @current_state = ''
begin
select @match = 0
break
end
print '-------------------------------------------------------------'
print 'DFA_simulate step ' + ltrim(str(@i))
print 'substring("' + @str + '", ' + ltrim(str(@i)) + ', 1) = ' + substring(@str, @i, 1)
print '@next_state = ' + @next_state
select @i = @i + 1, @current_state = @next_state
end
if @match = 1
set @match = case when @current_state in (select state from DFA_final_state_set) then 1 else 0 end
go
-- ========================================================================
exec clearobj 'regexp_match', 1
go
create proc regexp_match @pattern nvarchar(100), @input nvarchar(100), @match bit output
with encryption
as
exec regexp2parsetree @pattern
exec print_parsetree
--
exec thompson_construction
select * from NFA_trans_table
--
exec subset_construction
select * from DFA_trans_table
--
exec DFA_simulate @input, @match output
go
declare @b bit
exec regexp_match '(k|j)*ae(u|r)s', 'kkkaeps', @b output
select match=@b