HomeSort by relevance Sort by last modified time
    Searched refs:TOKEN_NAMES (Results 1 - 4 of 4) sorted by null

  /external/antlr/antlr-3.4/runtime/Ruby/test/unit/
test-scheme.rb 33 @ts::TOKEN_NAMES.should == {
53 @a_class.send(:token_names).should == {
test-trees.rb 793 TOKEN_NAMES = %w(
797 Tokens = TokenScheme.build( TOKEN_NAMES )
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
token.rb 422 2. add a new constant, TOKEN_NAMES, which is a hash that maps types to names
436 inverse type-to-name map to its own <tt>TOKEN_NAMES</tt> table.
487 the token types as named constants, a type-to-name map constant +TOKEN_NAMES+,
507 const_set( :TOKEN_NAMES, ::ANTLR3::Constants::BUILT_IN_TOKEN_NAMES.clone )
514 define_method( :token_names ) { scheme::TOKEN_NAMES }
517 token_names[ type ] or super
522 module_function :token_name, :token_names
530 def self.build( *token_names )
531 token_names = [ token_names ].flatten
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
Delphi.stg 319 TOKEN_NAMES: array [0..<length(tokenNames)>+3] of String = (
427 SetLength(Result,Length(T<grammar.composite.rootGrammar.recognizerName>.TOKEN_NAMES));
428 for I := 0 to Length(T<grammar.composite.rootGrammar.recognizerName>.TOKEN_NAMES) - 1 do
429 Result[I] := T<grammar.composite.rootGrammar.recognizerName>.TOKEN_NAMES[I];
    [all...]

Completed in 120 milliseconds