puppet 3.6.2-x86-mingw32 → 3.7.0-x86-mingw32

data/lib/puppet/file_system/tempfile.rb

@@ -1,20 +0,0 @@
-require 'tempfile'
-
-class Puppet::FileSystem::Tempfile
-
-  # Variation of Tempfile.open which ensures that the tempfile is closed and
-  # unlinked before returning
-  #
-  # @param identifier [String] additional part of generated pathname
-  # @yieldparam file [File] the temporary file object
-  # @return result of the passed block
-  # @api private
-  def self.open(identifier)
-    file = ::Tempfile.new(identifier)
-
-    yield file
-
-  ensure
-    file.close!
-  end
-end

data/lib/puppet/parser/e_parser_adapter.rb

@@ -1,119 +0,0 @@
-require 'puppet/pops'
-
-module Puppet; module Parser; end; end;
-# Adapts an egrammar/eparser to respond to the public API of the classic parser
-#
-class Puppet::Parser::EParserAdapter
-
-  def initialize(classic_parser)
-    @classic_parser = classic_parser
-    @file = ''
-    @string = ''
-    @use = :undefined
-  end
-
-  def file=(file)
-    @classic_parser.file = file
-    @file = file
-    @use = :file
-  end
-
-  def parse(string = nil)
-    if @file =~ /\.rb$/
-      return parse_ruby_file
-    else
-      self.string= string if string
-      parser = Puppet::Pops::Parser::Parser.new()
-      parse_result = if @use == :string
-        parser.parse_string(@string)
-      else
-        parser.parse_file(@file)
-      end
-      # Compute the source_file to set in created AST objects (it was either given, or it may be unknown
-      # if caller did not set a file and the present a string.
-      #
-      source_file = @file || "unknown-source-location"
-
-      # Validate
-      validate(parse_result)
-      # Transform the result, but only if not nil
-      parse_result = Puppet::Pops::Model::AstTransformer.new(source_file, @classic_parser).transform(parse_result) if parse_result
-      if parse_result && !parse_result.is_a?(Puppet::Parser::AST::BlockExpression)
-        # Need to transform again, if result is not wrapped in something iterable when handed off to
-        # a new Hostclass as its code.
-        parse_result = Puppet::Parser::AST::BlockExpression.new(:children => [parse_result]) if parse_result
-      end
-    end
-
-    Puppet::Parser::AST::Hostclass.new('', :code => parse_result)
-  end
-
-  def validate(parse_result)
-    # TODO: This is too many hoops to jump through... ugly API
-    # could reference a ValidatorFactory.validator_3_1(acceptor) instead.
-    # and let the factory abstract the rest.
-    #
-    return unless parse_result
-
-    acceptor  = Puppet::Pops::Validation::Acceptor.new
-    validator = Puppet::Pops::Validation::ValidatorFactory_3_1.new().validator(acceptor)
-    validator.validate(parse_result)
-
-    max_errors = Puppet[:max_errors]
-    max_warnings = Puppet[:max_warnings] + 1
-    max_deprecations = Puppet[:max_deprecations] + 1
-
-    # If there are warnings output them
-    warnings = acceptor.warnings
-    if warnings.size > 0
-      formatter = Puppet::Pops::Validation::DiagnosticFormatterPuppetStyle.new
-      emitted_w = 0
-      emitted_dw = 0
-      acceptor.warnings.each {|w|
-        if w.severity == :deprecation
-          # Do *not* call Puppet.deprecation_warning it is for internal deprecation, not
-          # deprecation of constructs in manifests! (It is not designed for that purpose even if
-          # used throughout the code base).
-          #
-          Puppet.warning(formatter.format(w)) if emitted_dw < max_deprecations
-          emitted_dw += 1
-        else
-          Puppet.warning(formatter.format(w)) if emitted_w < max_warnings
-          emitted_w += 1
-        end
-        break if emitted_w > max_warnings && emitted_dw > max_deprecations # but only then
-      }
-    end
-
-    # If there were errors, report the first found. Use a puppet style formatter.
-    errors = acceptor.errors
-    if errors.size > 0
-      formatter = Puppet::Pops::Validation::DiagnosticFormatterPuppetStyle.new
-      if errors.size == 1 || max_errors <= 1
-        # raise immediately
-        raise Puppet::ParseError.new(formatter.format(errors[0]))
-      end
-      emitted = 0
-      errors.each do |e|
-        Puppet.err(formatter.format(e))
-        emitted += 1
-        break if emitted >= max_errors
-      end
-      warnings_message = warnings.size > 0 ? ", and #{warnings.size} warnings" : ""
-      giving_up_message = "Found #{errors.size} errors#{warnings_message}. Giving up"
-      exception = Puppet::ParseError.new(giving_up_message)
-      exception.file = errors[0].file
-      raise exception
-    end
-  end
-
-  def string=(string)
-    @classic_parser.string = string
-    @string = string
-    @use = :string
-  end
-
-  def parse_ruby_file
-    @classic_parser.parse
-  end
-end

data/lib/puppet/parser/functions/collect.rb

@@ -1,15 +0,0 @@
-Puppet::Parser::Functions::newfunction(
-:collect,
-:type => :rvalue,
-:arity => 2,
-:doc => <<-'ENDHEREDOC') do |args|
-  The 'collect' function has been renamed to 'map'. Please update your manifests.
-
-  The collect function is reserved for future use.
-  - Removed as of 3.4
-  - requires `parser = future`.
-  ENDHEREDOC
-
-  raise NotImplementedError,
-    "The 'collect' function has been renamed to 'map'. Please update your manifests."
-end

data/lib/puppet/parser/functions/select.rb

@@ -1,15 +0,0 @@
-Puppet::Parser::Functions::newfunction(
-:select,
-:type => :rvalue,
-:arity => 2,
-:doc => <<-'ENDHEREDOC') do |args|
-  The 'select' function has been renamed to 'filter'. Please update your manifests.
-
-  The select function is reserved for future use.
-  - Removed as of 3.4
-  - requires `parser = future`.
-  ENDHEREDOC
-
-  raise NotImplementedError,
-    "The 'select' function has been renamed to 'filter'. Please update your manifests."
-end

data/lib/puppet/pops/loader/ruby_legacy_function_instantiator.rb

@@ -1,109 +0,0 @@
-# The RubyLegacyFunctionInstantiator loads a 3x function and turns it into a 4x function
-# that is called with 3x semantics (values are transformed to be 3x compliant).
-#
-# The code is loaded from a string obtained by reading the 3x function ruby code into a string
-# and then passing it to the loaders class method `create`. When Puppet[:biff] == true, the
-# 3x Puppet::Parser::Function.newfunction method relays back to this function loader's
-# class method legacy_newfunction which creates a Puppet::Functions class wrapping the 
-# 3x function's block into a method in a function class derived from Puppet::Function.
-# This class is then returned, and the Legacy loader continues the same way as it does
-# for a 4x function.
-#
-# TODO: Wrapping of Scope
-#   The 3x function expects itself to be Scope. It passes itself as scope to other parts of the runtime,
-#   it expects to find all sorts of information in itself, get/set variables, get compiler, get environment
-#   etc.
-# TODO: Transformation of arguments to 3x compliant objects
-#
-class Puppet::Pops::Loader::RubyLegacyFunctionInstantiator
-
-  # Produces an instance of the Function class with the given typed_name, or fails with an error if the
-  # given ruby source does not produce this instance when evaluated.
-  #
-  # @param loader [Puppet::Pops::Loader::Loader] The loader the function is associated with
-  # @param typed_name [Puppet::Pops::Loader::TypedName] the type / name of the function to load
-  # @param source_ref [URI, String] a reference to the source / origin of the ruby code to evaluate
-  # @param ruby_code_string [String] ruby code in a string
-  #
-  # @return [Puppet::Pops::Functions.Function] - an instantiated function with global scope closure associated with the given loader
-  #
-  def self.create(loader, typed_name, source_ref, ruby_code_string)
-    # Old Ruby API supports calling a method via ::
-    # this must also be checked as well as call with '.'
-    #
-    unless ruby_code_string.is_a?(String) && ruby_code_string =~ /Puppet\:\:Parser\:\:Functions(?:\.|\:\:)newfunction/
-      raise ArgumentError, "The code loaded from #{source_ref} does not seem to be a Puppet 3x API function - no newfunction call."
-    end
-
-    # The evaluation of the 3x function creation source should result in a call to the legacy_newfunction
-    #
-    created = eval(ruby_code_string)
-    unless created.is_a?(Class)
-      raise ArgumentError, "The code loaded from #{source_ref} did not produce a Function class when evaluated. Got '#{created.class}'"
-    end
-    unless created.name.to_s == typed_name.name()
-      raise ArgumentError, "The code loaded from #{source_ref} produced mis-matched name, expected '#{typed_name.name}', got #{created.name}"
-    end
-    # create the function instance - it needs closure (scope), and loader (i.e. where it should start searching for things
-    # when calling functions etc.
-    # It should be bound to global scope
-
-    # TODO: Cheating wrt. scope - assuming it is found in the context
-    closure_scope = Puppet.lookup(:global_scope) { {} }
-    created.new(closure_scope, loader)
-  end
-
-  # This is a new implementation of the method that is used in 3x to create a function.
-  # The arguments are the same as those passed to Puppet::Parser::Functions.newfunction, hence its
-  # deviation from regular method naming practice.
-  #
-  def self.legacy_newfunction(name, options, &block)
-
-    # 3x api allows arity to be specified, if unspecified it is 0 or more arguments
-    # arity >= 0, is an exact count
-    # airty < 0 is the number of required arguments -1 (i.e. -1 is 0 or more)
-    # (there is no upper cap, there is no support for optional values, or defaults)
-    #
-    arity = options[:arity] || -1
-    if arity >= 0
-      min_arg_count = arity
-      max_arg_count = arity
-    else
-      min_arg_count = (arity + 1).abs
-      # infinity
-      max_arg_count = :default
-    end
-
-    # Create a 4x function wrapper around the 3x Function
-    created_function_class = Puppet::Functions.create_function(name) do
-      # define a method on the new Function class with the same name as the function, but
-      # padded with __ because the function may represent a ruby method with the same name that
-      # expects to have inherited from Kernel, and then Object.
-      # (This can otherwise lead to infinite recursion, or that an ArgumentError is raised).
-      #
-      __name__ = :"__#{name}__"
-      define_method(__name__, &block)
-
-      # Define the method that is called from dispatch - this method just changes a call
-      # with multiple unknown arguments to passing all in an array (since this is expected in the 3x API).
-      # We want the call to be checked for type and number of arguments so cannot call the function
-      # defined by the block directly since it is defined to take a single argument.
-      #
-      define_method(:__relay__call__) do |*args|
-        # dup the args since the function may destroy them
-        # TODO: Should convert arguments to 3x, now :undef is send to the function
-        send(__name__, args.dup)
-      end
-
-      # Define a dispatch that performs argument type/count checking
-      #
-      dispatch :__relay__call__ do
-        # Use Puppet Type Object (not Optional[Object] since the 3x API passes undef as empty string).
-        param 'Object', 'args'
-        # Specify arg count (transformed from 3x function arity specification).
-        arg_count(min_arg_count, max_arg_count)
-      end
-    end
-    created_function_class
-  end
-end

data/lib/puppet/pops/parser/lexer.rb

@@ -1,753 +0,0 @@
-# the scanner/lexer
-
-require 'forwardable'
-require 'strscan'
-require 'puppet'
-require 'puppet/util/methodhelper'
-
-module Puppet
-  class LexError < RuntimeError; end
-end
-
-class Puppet::Pops::Parser::Lexer
-  extend Forwardable
-
-  attr_reader :file, :lexing_context, :token_queue
-
-  attr_reader :locator
-
-  attr_accessor :indefine
-  alias :indefine? :indefine
-
-  def lex_error msg
-    raise Puppet::LexError.new(msg)
-  end
-
-  class Token
-    ALWAYS_ACCEPTABLE = Proc.new { |context| true }
-
-    include Puppet::Util::MethodHelper
-
-    attr_accessor :regex, :name, :string, :skip, :skip_text
-    alias skip? skip
-
-    # @overload initialize(string)
-    #   @param string [String] a literal string token matcher
-    #   @param name [String] the token name (what it is known as in the grammar)
-    #   @param options [Hash] see {#set_options}
-    # @overload initialize(regex)
-    #   @param regex [Regexp] a regular expression token text matcher
-    #   @param name [String] the token name (what it is known as in the grammar)
-    #   @param options [Hash] see {#set_options}
-    #
-    def initialize(string_or_regex, name, options = {})
-      if string_or_regex.is_a?(String)
-        @name, @string = name, string_or_regex
-        @regex = Regexp.new(Regexp.escape(string_or_regex))
-      else
-        @name, @regex = name, string_or_regex
-      end
-
-      set_options(options)
-      @acceptable_when = ALWAYS_ACCEPTABLE
-    end
-
-    # @return [String] human readable token reference; the String if literal, else the token name
-    def to_s
-      string or @name.to_s
-    end
-
-    # @return [Boolean] if the token is acceptable in the given context or not.
-    # @param context [Hash] the lexing context
-    #
-    def acceptable?(context={})
-      @acceptable_when.call(context)
-    end
-
-
-    # Defines when the token is able to match.
-    # This provides context that cannot be expressed otherwise, such as feature flags.
-    #
-    # @param block [Proc] a proc that given a context returns a boolean
-    def acceptable_when(block)
-      @acceptable_when = block
-    end
-  end
-
-  # Maintains a list of tokens.
-  class TokenList
-    extend Forwardable
-
-    attr_reader :regex_tokens, :string_tokens
-    def_delegator :@tokens, :[]
-    # Adds a new token to the set of recognized tokens
-    # @param name [String] the token name
-    # @param regex [Regexp, String] source text token matcher, a litral string or regular expression
-    # @param options [Hash] see {Token::set_options}
-    # @param block [Proc] optional block set as the created tokens `convert` method
-    # @raise [ArgumentError] if the token with the given name is already defined
-    #
-    def add_token(name, regex, options = {}, &block)
-      raise(ArgumentError, "Token #{name} already exists") if @tokens.include?(name)
-      token = Token.new(regex, name, options)
-      @tokens[token.name] = token
-      if token.string
-        @string_tokens << token
-        @tokens_by_string[token.string] = token
-      else
-        @regex_tokens << token
-      end
-
-      token.meta_def(:convert, &block) if block_given?
-
-      token
-    end
-
-    # Creates an empty token list
-    #
-    def initialize
-      @tokens = {}
-      @regex_tokens = []
-      @string_tokens = []
-      @tokens_by_string = {}
-    end
-
-    # Look up a token by its literal (match) value, rather than name.
-    # @param string [String, nil] the literal match string to obtain a {Token} for, or nil if it does not exist.
-    def lookup(string)
-      @tokens_by_string[string]
-    end
-
-    # Adds tokens from a hash where key is a matcher (literal string or regexp) and the
-    # value is the token's name
-    # @param hash [Hash<{String => Symbol}, Hash<{Regexp => Symbol}] map token text matcher to token name
-    # @return [void]
-    #
-    def add_tokens(hash)
-      hash.each do |regex, name|
-        add_token(name, regex)
-      end
-    end
-
-    # Sort literal (string-) tokens by length, so we know once we match, we're done.
-    # This helps avoid the O(n^2) nature of token matching.
-    # The tokens are sorted in place.
-    # @return [void]
-    def sort_tokens
-      @string_tokens.sort! { |a, b| b.string.length <=> a.string.length }
-    end
-
-    # Yield each token name and value in turn.
-    def each
-      @tokens.each {|name, value| yield name, value }
-    end
-  end
-
-  TOKENS = TokenList.new
-  TOKENS.add_tokens(
-  '['   => :LBRACK,
-  ']'   => :RBRACK,
-  #    '{'   => :LBRACE, # Specialized to handle lambda and brace count
-  #    '}'   => :RBRACE, # Specialized to handle brace count
-  '('   => :LPAREN,
-  ')'   => :RPAREN,
-  '='   => :EQUALS,
-  '+='  => :APPENDS,
-  '-='  => :DELETES,
-  '=='  => :ISEQUAL,
-  '>='  => :GREATEREQUAL,
-  '>'   => :GREATERTHAN,
-  '<'   => :LESSTHAN,
-  '<='  => :LESSEQUAL,
-  '!='  => :NOTEQUAL,
-  '!'   => :NOT,
-  ','   => :COMMA,
-  '.'   => :DOT,
-  ':'   => :COLON,
-  '@'   => :AT,
-  '|'   => :PIPE,
-  '<<|' => :LLCOLLECT,
-  '|>>' => :RRCOLLECT,
-  '->'  => :IN_EDGE,
-  '<-'  => :OUT_EDGE,
-  '~>'  => :IN_EDGE_SUB,
-  '<~'  => :OUT_EDGE_SUB,
-  '<|'  => :LCOLLECT,
-  '|>'  => :RCOLLECT,
-  ';'   => :SEMIC,
-  '?'   => :QMARK,
-  '\\'  => :BACKSLASH,
-  '=>'  => :FARROW,
-  '+>'  => :PARROW,
-  '+'   => :PLUS,
-  '-'   => :MINUS,
-  '/'   => :DIV,
-  '*'   => :TIMES,
-  '%'   => :MODULO,
-  '<<'  => :LSHIFT,
-  '>>'  => :RSHIFT,
-  '=~'  => :MATCH,
-  '!~'  => :NOMATCH,
-  %r{((::){0,1}[A-Z][-\w]*)+} => :CLASSREF,
-  "<string>" => :STRING,
-  "<dqstring up to first interpolation>" => :DQPRE,
-  "<dqstring between two interpolations>" => :DQMID,
-  "<dqstring after final interpolation>" => :DQPOST,
-  "<boolean>" => :BOOLEAN,
-  "<select start>" => :SELBRACE # A QMARK followed by '{'
-  )
-
-  module Contextual
-    QUOTE_TOKENS = [:DQPRE,:DQMID]
-    REGEX_INTRODUCING_TOKENS = [:NODE,:LBRACE, :SELBRACE, :RBRACE,:MATCH,:NOMATCH,:COMMA]
-
-    NOT_INSIDE_QUOTES = Proc.new do |context|
-      !QUOTE_TOKENS.include? context[:after]
-    end
-
-    INSIDE_QUOTES = Proc.new do |context|
-      QUOTE_TOKENS.include? context[:after]
-    end
-
-    IN_REGEX_POSITION = Proc.new do |context|
-      REGEX_INTRODUCING_TOKENS.include? context[:after]
-    end
-
-#    DASHED_VARIABLES_ALLOWED = Proc.new do |context|
-#      Puppet[:allow_variables_with_dashes]
-#    end
-#
-#    VARIABLE_AND_DASHES_ALLOWED = Proc.new do |context|
-#      Contextual::DASHED_VARIABLES_ALLOWED.call(context) and TOKENS[:VARIABLE].acceptable?(context)
-#    end
-  end
-
-  # Numbers are treated separately from names, so that they may contain dots.
-  TOKENS.add_token :NUMBER, %r{\b(?:0[xX][0-9A-Fa-f]+|0?\d+(?:\.\d+)?(?:[eE]-?\d+)?)\b} do |lexer, value|
-    lexer.assert_numeric(value)
-    [TOKENS[:NAME], value]
-  end
-  TOKENS[:NUMBER].acceptable_when Contextual::NOT_INSIDE_QUOTES
-
-  TOKENS.add_token :NAME, %r{((::)?[a-z0-9][-\w]*)(::[a-z0-9][-\w]*)*} do |lexer, value|
-    # A name starting with a number must be a valid numeric string (not that
-    # NUMBER token captures those names that do not comply with the name rule.
-    if value =~ /^[0-9].*$/
-      lexer.assert_numeric(value)
-    end
-
-    string_token = self
-    # we're looking for keywords here
-    if tmp = KEYWORDS.lookup(value)
-      string_token = tmp
-      if [:TRUE, :FALSE].include?(string_token.name)
-        value = eval(value)
-        string_token = TOKENS[:BOOLEAN]
-      end
-    end
-    [string_token, value]
-  end
-  [:NAME, :CLASSREF].each do |name_token|
-    TOKENS[name_token].acceptable_when Contextual::NOT_INSIDE_QUOTES
-  end
-
-  TOKENS.add_token :COMMENT, %r{#.*}, :skip => true do |lexer,value|
-#    value.sub!(/# ?/,'')
-    [self, ""]
-  end
-
-  TOKENS.add_token :MLCOMMENT, %r{/\*(.*?)\*/}m, :skip => true do |lexer, value|
-#    value.sub!(/^\/\* ?/,'')
-#    value.sub!(/ ?\*\/$/,'')
-    [self, ""]
-  end
-
-  TOKENS.add_token :REGEX, %r{/[^/\n]*/} do |lexer, value|
-    # Make sure we haven't matched an escaped /
-    while value[-2..-2] == '\\'
-      other = lexer.scan_until(%r{/})
-      value += other
-    end
-    regex = value.sub(%r{\A/}, "").sub(%r{/\Z}, '').gsub("\\/", "/")
-    [self, Regexp.new(regex)]
-  end
-  TOKENS[:REGEX].acceptable_when Contextual::IN_REGEX_POSITION
-
-  TOKENS.add_token :RETURN, "\n", :skip => true, :skip_text => true
-
-  TOKENS.add_token :SQUOTE, "'" do |lexer, value|
-    [TOKENS[:STRING], lexer.slurpstring(value,["'"],:ignore_invalid_escapes).first ]
-  end
-
-  DQ_initial_token_types      = {'$' => :DQPRE,'"' => :STRING}
-  DQ_continuation_token_types = {'$' => :DQMID,'"' => :DQPOST}
-
-  TOKENS.add_token :DQUOTE, /"/ do |lexer, value|
-    lexer.tokenize_interpolated_string(DQ_initial_token_types)
-  end
-
-
-  # LBRACE needs look ahead to differentiate between '{' and a '{'
-  # followed by a '|' (start of lambda) The racc grammar can only do one
-  # token lookahead.
-  #
-  TOKENS.add_token :LBRACE, "{" do |lexer, value|
-    lexer.lexing_context[:brace_count] += 1
-    if lexer.lexing_context[:after] == :QMARK
-      [TOKENS[:SELBRACE], value]
-    else
-      [TOKENS[:LBRACE], value]
-    end
-  end
-
-  # RBRACE needs to differentiate between a regular brace that is part of
-  # syntax and one that is the ending of a string interpolation.
-  TOKENS.add_token :RBRACE, "}" do |lexer, value|
-    context = lexer.lexing_context
-    if context[:interpolation_stack].empty? || context[:brace_count] != context[:interpolation_stack][-1]
-      context[:brace_count] -= 1
-      [TOKENS[:RBRACE], value]
-    else
-      lexer.tokenize_interpolated_string(DQ_continuation_token_types)
-    end
-  end
-
-  TOKENS.add_token :DOLLAR_VAR, %r{\$(::)?(\w+::)*\w+} do |lexer, value|
-    [TOKENS[:VARIABLE],value[1..-1]]
-  end
-
-  TOKENS.add_token :VARIABLE, %r{(::)?(\w+::)*\w+} do |lexer, value|
-    # If the varname (following $, or ${ is followed by (, it is a function call, and not a variable
-    # reference.
-    #
-    if lexer.match?(%r{[ \t\r]*\(})
-      # followed by ( is a function call
-      [TOKENS[:NAME], value]
-
-    elsif kwd_token = KEYWORDS.lookup(value)
-      # true, false, if, unless, case, and undef are keywords that cannot be used as variables
-      # but node, and several others are variables
-      if [ :TRUE, :FALSE ].include?(kwd_token.name)
-        [ TOKENS[:BOOLEAN], eval(value) ]
-      elsif [ :IF, :UNLESS, :CASE, :UNDEF ].include?(kwd_token.name)
-        [kwd_token, value]
-      else
-        [TOKENS[:VARIABLE], value]
-      end
-    else
-      [TOKENS[:VARIABLE], value]
-    end
-
-  end
-  TOKENS[:VARIABLE].acceptable_when Contextual::INSIDE_QUOTES
-
-  TOKENS.sort_tokens
-
-  @@pairs = {
-    "{"   => "}",
-    "("   => ")",
-    "["   => "]",
-    "<|"  => "|>",
-    "<<|" => "|>>",
-    "|"   => "|"
-  }
-
-  KEYWORDS = TokenList.new
-  KEYWORDS.add_tokens(
-  "case"     => :CASE,
-  "class"    => :CLASS,
-  "default"  => :DEFAULT,
-  "define"   => :DEFINE,
-  #    "import"   => :IMPORT,
-  "if"       => :IF,
-  "elsif"    => :ELSIF,
-  "else"     => :ELSE,
-  "inherits" => :INHERITS,
-  "node"     => :NODE,
-  "and"      => :AND,
-  "or"       => :OR,
-  "undef"    => :UNDEF,
-  "false"    => :FALSE,
-  "true"     => :TRUE,
-  "in"       => :IN,
-  "unless"   => :UNLESS
-  )
-
-  def clear
-    initvars
-  end
-
-  def expected
-    return nil if @expected.empty?
-    name = @expected[-1]
-    TOKENS.lookup(name) or lex_error "Internal Lexer Error: Could not find expected token #{name}"
-  end
-
-  # scan the whole file
-  # basically just used for testing
-  def fullscan
-    array = []
-
-    self.scan { |token, str|
-      # Ignore any definition nesting problems
-      @indefine = false
-      array.push([token,str])
-    }
-    array
-  end
-
-  def file=(file)
-    @file = file
-    contents = Puppet::FileSystem.exist?(file) ? Puppet::FileSystem.read(file) : ""
-    @scanner = StringScanner.new(contents.freeze)
-    @locator = Puppet::Pops::Parser::Locator.locator(contents, file)
-  end
-
-  def_delegator :@token_queue, :shift, :shift_token
-
-  def find_string_token
-    # We know our longest string token is three chars, so try each size in turn
-    # until we either match or run out of chars.  This way our worst-case is three
-    # tries, where it is otherwise the number of string token we have.  Also,
-    # the lookups are optimized hash lookups, instead of regex scans.
-    #
-    _scn = @scanner
-    s = _scn.peek(3)
-    token = TOKENS.lookup(s[0,3]) || TOKENS.lookup(s[0,2]) || TOKENS.lookup(s[0,1])
-    unless token
-      return [nil, nil]
-    end
-    [ token, _scn.scan(token.regex) ]
-  end
-
-  # Find the next token that matches a regex.  We look for these first.
-  def find_regex_token
-    best_token = nil
-    best_length = 0
-
-    # I tried optimizing based on the first char, but it had
-    # a slightly negative affect and was a good bit more complicated.
-    _lxc = @lexing_context
-    _scn = @scanner
-    TOKENS.regex_tokens.each do |token|
-      if length = _scn.match?(token.regex) and token.acceptable?(_lxc)
-        # We've found a longer match
-        if length > best_length
-          best_length = length
-          best_token = token
-        end
-      end
-    end
-
-    return best_token, _scn.scan(best_token.regex) if best_token
-  end
-
-  # Find the next token, returning the string and the token.
-  def find_token
-    shift_token || find_regex_token || find_string_token
-  end
-
-  MULTIBYTE = Puppet::Pops::Parser::Locator::MULTIBYTE
-  SKIPPATTERN = MULTIBYTE ? %r{[[:blank:]\r]+} : %r{[ \t\r]+}
-
-  def initialize
-    initvars
-  end
-
-  def assert_numeric(value)
-    if value =~ /^0[xX].*$/
-      lex_error (positioned_message("Not a valid hex number #{value}")) unless value =~ /^0[xX][0-9A-Fa-f]+$/
-    elsif value =~ /^0[^.].*$/
-      lex_error(positioned_message("Not a valid octal number #{value}")) unless value =~ /^0[0-7]+$/
-    else
-      lex_error(positioned_message("Not a valid decimal number #{value}")) unless value =~ /0?\d+(?:\.\d+)?(?:[eE]-?\d+)?/
-    end
-  end
-
-  def initvars
-    @previous_token = nil
-    @scanner = nil
-    @file = nil
-
-    # AAARRGGGG! okay, regexes in ruby are bloody annoying
-    # no one else has "\n" =~ /\s/
-
-    @namestack = []
-    @token_queue = []
-    @indefine = false
-    @expected = []
-    @lexing_context = {
-      :after => nil,
-      :start_of_line => true,
-      :offset => 0,      # byte offset before where token starts
-      :end_offset => 0,  # byte offset after scanned token
-      :brace_count => 0,  # nested depth of braces
-      :interpolation_stack => []   # matching interpolation brace level
-    }
-  end
-
-  # Make any necessary changes to the token and/or value.
-  def munge_token(token, value)
-    # A token may already have been munged (converted and positioned)
-    #
-    return token, value if value.is_a? Hash
-
-    @scanner.skip(SKIPPATTERN) if token.skip_text
-
-    return if token.skip
-
-    token, value = token.convert(self, value) if token.respond_to?(:convert)
-
-    return unless token
-
-    return if token.skip
-
-    # If the conversion performed the munging/positioning
-    return token, value if value.is_a? Hash
-
-    return token, positioned_value(value)
-  end
-
-  # Returns a hash with the current position in source based on the current lexing context
-  #
-  def positioned_value(value)
-    {
-      :value => value,
-      :locator => @locator,
-      :offset => @lexing_context[:offset],
-      :end_offset => @lexing_context[:end_offset]
-    }
-  end
-
-  def pos
-    @locator.pos_on_line(@lexing_context[:offset])
-  end
-
-  # Handling the namespace stack
-  def_delegator :@namestack, :pop, :namepop
-
-  # This value might have :: in it, but we don't care -- it'll be handled
-  # normally when joining, and when popping we want to pop this full value,
-  # however long the namespace is.
-  def_delegator :@namestack, :<<, :namestack
-
-  # Collect the current namespace.
-  def namespace
-    @namestack.join("::")
-  end
-
-  def_delegator :@scanner, :rest
-
-  LBRACE_CHAR = '{'
-
-  # this is the heart of the lexer
-  def scan
-    _scn = @scanner
-    #Puppet.debug("entering scan")
-    lex_error "Internal Error: No string or file given to lexer to process." unless _scn
-
-    # Skip any initial whitespace.
-    _scn.skip(SKIPPATTERN)
-    _lbrace = '{'.freeze  # faster to compare against a frozen string in
-
-    until token_queue.empty? and _scn.eos? do
-      offset = _scn.pos
-      matched_token, value = find_token
-      end_offset = _scn.pos
-
-      # error out if we didn't match anything at all
-      lex_error "Could not match #{_scn.rest[/^(\S+|\s+|.*)/]}" unless matched_token
-
-      newline = matched_token.name == :RETURN
-
-      _lxc = @lexing_context
-      _lxc[:start_of_line] = newline
-      _lxc[:offset] = offset
-      _lxc[:end_offset] = end_offset
-
-      final_token, token_value = munge_token(matched_token, value)
-      # update end position since munging may have moved the end offset
-      _lxc[:end_offset] = _scn.pos
-
-      unless final_token
-        _scn.skip(SKIPPATTERN)
-        next
-      end
-
-      _lxc[:after] = final_token.name unless newline
-      if final_token.name == :DQPRE
-        _lxc[:interpolation_stack] << _lxc[:brace_count]
-      elsif final_token.name == :DQPOST
-        _lxc[:interpolation_stack].pop
-      end
-
-      value = token_value[:value]
-
-      _expected = @expected
-      if match = @@pairs[value] and final_token.name != :DQUOTE and final_token.name != :SQUOTE
-        _expected << match
-      elsif exp = _expected[-1] and exp == value and final_token.name != :DQUOTE and final_token.name != :SQUOTE
-        _expected.pop
-      end
-
-      yield [final_token.name, token_value]
-
-      _prv = @previous_token
-      if _prv
-        namestack(value) if _prv.name == :CLASS and value != LBRACE_CHAR
-
-        # TODO: Lexer has no business dealing with this - it is semantic
-        if _prv.name == :DEFINE
-          if indefine?
-            msg = "Cannot nest definition #{value} inside #{@indefine}"
-            self.indefine = false
-            raise Puppet::ParseError, msg
-          end
-
-          @indefine = value
-        end
-      end
-      @previous_token = final_token
-      _scn.skip(SKIPPATTERN)
-    end
-    # Cannot reset @scanner to nil here - it is needed to answer questions about context after
-    # completed parsing.
-    # Seems meaningless to do this. Everything will be gc anyway.
-    #@scanner = nil
-
-    # This indicates that we're done parsing.
-    yield [false,false]
-  end
-
-  def match? r
-    @scanner.match?(r)
-  end
-
-  # Provide some limited access to the scanner, for those
-  # tokens that need it.
-  def_delegator :@scanner, :scan_until
-
-  # we've encountered the start of a string...
-  # slurp in the rest of the string and return it
-  def slurpstring(terminators,escapes=%w{ \\  $ ' " r n t s }+["\n"],ignore_invalid_escapes=false)
-    # we search for the next quote that isn't preceded by a
-    # backslash; the caret is there to match empty strings
-    last = @scanner.matched
-    str = @scanner.scan_until(/([^\\]|^|[^\\])([\\]{2})*[#{terminators}]/) || lex_error(positioned_message("Unclosed quote after #{format_quote(last)} followed by '#{followed_by}'"))
-    str.gsub!(/\\(.)/m) {
-      ch = $1
-      if escapes.include? ch
-        case ch
-        when 'r'; "\r"
-        when 'n'; "\n"
-        when 't'; "\t"
-        when 's'; " "
-        when "\n"; ''
-        else      ch
-        end
-      else
-        Puppet.warning(positioned_message("Unrecognized escape sequence '\\#{ch}'")) unless ignore_invalid_escapes
-        "\\#{ch}"
-      end
-    }
-    [ str[0..-2],str[-1,1] ]
-  end
-
-  # Formats given message by appending file, line and position if available.
-  def positioned_message msg
-    result = [msg]
-    result << "in file #{file}" if file
-    result << "at line #{line}:#{pos}" if line
-    result.join(" ")
-  end
-
-  # Returns "<eof>" if at end of input, else the following 5 characters with \n \r \t escaped
-  def followed_by
-    return "<eof>" if @scanner.eos?
-    result = @scanner.rest[0,5] + "..."
-    result.gsub!("\t", '\t')
-    result.gsub!("\n", '\n')
-    result.gsub!("\r", '\r')
-    result
-  end
-
-  def format_quote q
-    if q == "'"
-      '"\'"'
-    else
-      "'#{q}'"
-    end
-  end
-
-  def tokenize_interpolated_string(token_type,preamble='')
-    # Expecting a (possibly empty) stretch of text terminated by end of string ", a variable $, or expression ${
-    # The length of this part includes the start and terminating characters.
-    value,terminator = slurpstring('"$')
-
-    # Advanced after '{' if this is in expression ${} interpolation
-    braced = terminator == '$' && @scanner.scan(/\{/)
-    # make offset to end_ofset be the length of the pre expression string including its start and terminating chars
-    lxc = @lexing_context
-    lxc[:end_offset] = @scanner.pos
-
-    token_queue << [TOKENS[token_type[terminator]],positioned_value(preamble+value)]
-    variable_regex = if Puppet[:allow_variables_with_dashes]
-      TOKENS[:VARIABLE_WITH_DASH].regex
-    else
-      TOKENS[:VARIABLE].regex
-    end
-    if terminator != '$' or braced
-      return token_queue.shift
-    end
-
-    tmp_offset = @scanner.pos
-    if var_name = @scanner.scan(variable_regex)
-      lxc[:offset] = tmp_offset
-      lxc[:end_offset] = @scanner.pos
-      warn_if_variable_has_hyphen(var_name)
-      # If the varname after ${ is followed by (, it is a function call, and not a variable
-      # reference.
-      #
-      if braced && @scanner.match?(%r{[ \t\r]*\(})
-        token_queue << [TOKENS[:NAME], positioned_value(var_name)]
-      else
-        token_queue << [TOKENS[:VARIABLE],positioned_value(var_name)]
-      end
-      lxc[:offset] = @scanner.pos
-      tokenize_interpolated_string(DQ_continuation_token_types)
-    else
-      tokenize_interpolated_string(token_type, replace_false_start_with_text(terminator))
-    end
-  end
-
-  def replace_false_start_with_text(appendix)
-    last_token = token_queue.pop
-    value = last_token.last
-    if value.is_a? Hash
-      value[:value] + appendix
-    else
-      value + appendix
-    end
-  end
-
-  # just parse a string, not a whole file
-  def string=(string, path='')
-    @scanner = StringScanner.new(string.freeze)
-    @locator = Puppet::Pops::Parser::Locator.locator(string, path)
-  end
-
-  def warn_if_variable_has_hyphen(var_name)
-    if var_name.include?('-')
-      Puppet.deprecation_warning("Using `-` in variable names is deprecated at #{file || '<string>'}:#{line}. See http://links.puppetlabs.com/puppet-hyphenated-variable-deprecation")
-    end
-  end
-
-  # Returns the line number (starting from 1) for the current position
-  # in the scanned text (at the end of the last produced, but not necessarily
-  # consumed.
-  #
-  def line
-    return 1 unless @lexing_context && locator
-    locator.line_for_offset(@lexing_context[:end_offset])
-  end
-end