@@ -410,7 +410,19 @@ public void TestFluentSubNodeNames()
410
410
. IgnoreKeywordCase ( true )
411
411
. AlphaNumDashId ( FluentToken . ID )
412
412
. Date ( FluentToken . DATE , DateFormat . YYYYMMDD , '-' )
413
- . AlphaNumDashId ( FluentToken . ID ) ;
413
+ . AlphaNumDashId ( FluentToken . ID )
414
+ . UseLexerPostProcessor ( tokens =>
415
+ {
416
+ return tokens . Select < Token < FluentToken > , Token < FluentToken > > ( x =>
417
+ {
418
+ if ( x . TokenID == FluentToken . ID )
419
+ {
420
+ x . SpanValue = x . Value . ToUpper ( ) . AsMemory ( ) ;
421
+ }
422
+
423
+ return x ;
424
+ } ) . ToList ( ) ;
425
+ } ) ;
414
426
415
427
var build = FluentEBNFParserBuilder < FluentToken , string > . NewBuilder ( new FluentTests ( ) , "root" , "en" )
416
428
. Production ( "root : (l 'SEP'[d] r)*" , args =>
@@ -433,7 +445,7 @@ public void TestFluentSubNodeNames()
433
445
Check . That ( build ) . IsOk ( ) ;
434
446
var parsed = build . Result . Parse ( "a SEP b c SEP d " ) ;
435
447
Check . That ( parsed ) . IsOkParsing ( ) ;
436
- Check . That ( parsed . Result ) . IsEqualTo ( "a|b,c|d " ) ;
448
+ Check . That ( parsed . Result ) . IsEqualTo ( "A|B,C|D " ) ;
437
449
var tree = parsed . SyntaxTree as SyntaxNode < FluentToken , string > ;
438
450
Check . That ( tree ) . IsNotNull ( ) ;
439
451
Check . That ( tree . Children ) . IsSingle ( ) ;
0 commit comments