nasl 0.0.8 → 0.1.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f1211036372f4f6f5cf6638769d1de8d46720ffd
+  data.tar.gz: 996d639bae9ddda1394e59745c19eafaca51eb45
+SHA512:
+  metadata.gz: d376f113cf2fead0955db0b34a56855128f6c8dee42999fbb4173857b649de5ffe31aa3db31129f1879af46ed6c73adb8a7381e46d92cebbb4ae078bca6b5c5d
+  data.tar.gz: 8c90427b235c11cfffae66f294125dfd2094af5fe8cce28701867d84a9e9de95cfc5cba2bf33206cc3eb9b8e49556405a5293fdabac50bb2e9075af956239345

data/.gitignore

@@ -7,3 +7,8 @@ pkg/*
 # Generated files.
 *.rex.rb
 *.tab.rb
+
+# Backup files.
+\#*\#
+*~
+*.bak

data/README.md

@@ -1,32 +1,28 @@
-Installation
-============
+# Installation
 
-Git
----
+## Git
 
 Installing the source from Git is done as follows:
 
     git clone git://github.com/tenable/nasl.git
 
-Gem
----
+## Gem
+
 
 Installing the package from RubyGems is done as follows:
 
     gem install nasl
 
-Usage
-=====
+# Usage
 
-Standalone
-----------
+## Standalone
 
 To avoid conflicting with the NASL interpreter, the NASL gem's binary is
-installed as <nasl-parse>. As an application, it has very few actions that it
+installed as `nasl-parse`. As an application, it has very few actions that it
 can perform.
 
 * Benchmark: This benchmarks the time taken to parse the input path(s) over a
-  number of iterations. The number of iterations can be adjusted by the <-i>
+  number of iterations. The number of iterations can be adjusted by the `-i`
   switch.
 
         % nasl-parse -i 10 benchmark /opt/nessus/lib/nessus/plugins/ssl_certificate_chain.nasl
@@ -89,11 +85,10 @@ can perform.
         ...
         -------------------------[ ssl_certificate_chain.nasl ]-------------------------
 
-Library
--------
+# Library
 
 The primary users of this gem are [Pedant][pedant] and [Nasldoc][nasldoc]. Other
-uses are encouraged, of course! The <Parser> class is the most useful part,
+uses are encouraged, of course! The `Parser` class is the most useful part,
 obviously, and can be used as follows:
 
     require 'nasl'
@@ -101,7 +96,7 @@ obviously, and can be used as follows:
     tree = Nasl::Parser.new.parse(file_contents, path_to_file)
 
 That's all there is to it. If there are any errors, it'll throw an instance of
-<ParseException> that will include as much context about the error as possible.
+`ParseException` that will include as much context about the error as possible.
 
 [nasldoc]: https://github.com/tenable/nasldoc
 [pedant]: https://github.com/tenable/pedant

data/Rakefile

@@ -1,3 +1,29 @@
+################################################################################
+# Copyright (c) 2011-2014, Tenable Network Security
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+# 1. Redistributions of source code must retain the above copyright notice, this
+#    list of conditions and the following disclaimer.
+#
+# 2. Redistributions in binary form must reproduce the above copyright notice,
+#    this list of conditions and the following disclaimer in the documentation
+#    and/or other materials provided with the distribution.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+################################################################################
+
 $LOAD_PATH.unshift File.expand_path("../lib", __FILE__)
 
 require 'bundler/gem_tasks'
@@ -24,4 +50,16 @@ task :build => :compile do
   system "gem build nasl.gemspec"
 end
 
+task :tag_and_bag do
+	system "git tag -a v#{Nasl::VERSION} -m 'version #{Nasl::VERSION}'"
+	system "git push --tags"
+	system "git checkout master"
+	system "git merge #{Nasl::VERSION}"
+	system "git push"
+end
+
+task :release => [:tag_and_bag, :build] do
+ 	system "gem push #{Nasl::APP_NAME}-#{Nasl::VERSION}.gem"
+end
+
 task :default => :compile

data/bin/nasl-parse

@@ -1,7 +1,7 @@
 #!/usr/bin/env ruby
 
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl.rb

@@ -1,5 +1,5 @@
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/cli.rb

@@ -1,5 +1,5 @@
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/command.rb

@@ -1,5 +1,5 @@
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/commands/benchmark.rb

@@ -1,5 +1,5 @@
 ###############################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Mak Kolybabi
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/commands/parse.rb

@@ -1,5 +1,5 @@
 ###############################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Mak Kolybabi
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/commands/test.rb

@@ -1,5 +1,5 @@
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/commands/tokenize.rb

@@ -1,5 +1,5 @@
 ###############################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Mak Kolybabi
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/commands/xml.rb

@@ -1,5 +1,5 @@
 ###############################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Mak Kolybabi
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without

data/lib/nasl/context.rb

@@ -1,5 +1,5 @@
-###############################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+################################################################################
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without
@@ -86,18 +86,18 @@ module Nasl
       # no text to the left is at the start of the program.
       if outer.begin != inner.begin
         line = @code[outer.begin...inner.begin]
-        line = line.color(:green) if color
+        line = Rainbow(line).color(:green) if color
         ctx << line
       end
 
       # Create the text in the region.
       line = @code[inner.begin...inner.end]
-      line = line.color(:red) if color
+      line = Rainbow(line).color(:red) if color
       ctx << line
 
       # Create the text to the right of the region.
       line = @code[inner.end...outer.end].chomp
-      line = line.color(:green) if color
+      line = Rainbow(line).color(:green) if color
       ctx << line
 
       ctx << "\n"

data/lib/nasl/grammar.racc

@@ -1,5 +1,5 @@
 ################################################################################
-# Copyright (c) 2011-2012, Mak Kolybabi
+# Copyright (c) 2011-2014, Tenable Network Security
 # All rights reserved.
 #
 # Redistribution and use in source and binary forms, with or without
@@ -33,7 +33,7 @@ preclow
   left CMP_LT CMP_GT CMP_EQ CMP_NE CMP_GE CMP_LE SUBSTR_EQ SUBSTR_NE REGEX_EQ REGEX_NE
   left BIT_OR
   left BIT_XOR
-  left BIT_AND
+  left AMPERSAND
   left BIT_SRA BIT_SRL BIT_SLL
   left ADD SUB
   left MUL DIV MOD
@@ -174,7 +174,7 @@ rule
              { n(:Empty, *val) }
              ;
 
-  global     : GLOBAL idents SEMICOLON
+  global     : GLOBAL var_decls SEMICOLON
              { n(:Global, *val) }
              ;
 
@@ -190,7 +190,7 @@ rule
              { n(:Include, *val) }
              ;
 
-  local      : LOCAL idents SEMICOLON
+  local      : LOCAL var_decls SEMICOLON
              { n(:Local, *val) }
              ;
 
@@ -199,6 +199,8 @@ rule
              ;
 
   return     : RETURN expr SEMICOLON
+             { n(:Return, *val) }
+             | RETURN ref SEMICOLON
              { n(:Return, *val) }
              | RETURN SEMICOLON
              { n(:Return, *val) }
@@ -219,7 +221,9 @@ rule
              ;
 
   foreach    : FOREACH ident LPAREN expr RPAREN statement
-             { n(:Foreach, *val) }
+             { n(:Foreach, val[1], val[3], val[5]) }
+             | FOREACH LPAREN ident IN expr RPAREN statement
+             { n(:Foreach, val[2], val[4], val[6]) }
              ;
 
   if         : IF LPAREN expr RPAREN statement
@@ -241,6 +245,8 @@ rule
   ##############################################################################
 
   assign_exp : lval ASS_EQ expr
+             { n(:Assignment, *val) }
+             | lval ASS_EQ ref
              { n(:Assignment, *val) }
              | lval ADD_EQ expr
              { n(:Assignment, *val) }
@@ -260,10 +266,11 @@ rule
              { n(:Assignment, *val) }
              ;
 
-  call_exp   : ident LPAREN args RPAREN
+  call_exp   : lval LPAREN args RPAREN
              { n(:Call, *val) }
-             | ident LPAREN RPAREN
+             | lval LPAREN RPAREN
              { n(:Call, *val) }
+             ;
 
   decr_exp   : DECR lval
              { n(:Decrement, val[0]) }
@@ -301,7 +308,7 @@ rule
              { n(:Expression, *val) }
              | expr MOD expr
              { n(:Expression, *val) }
-             | expr BIT_AND expr
+             | expr AMPERSAND expr
              { n(:Expression, *val) }
              | expr BIT_XOR expr
              { n(:Expression, *val) }
@@ -351,6 +358,10 @@ rule
              { val[0] }
              | undef
              { val[0] }
+             | list_expr
+             { val[0] }
+             | array_expr
+             { val[0] }
              ;
 
   ##############################################################################
@@ -358,9 +369,31 @@ rule
   ##############################################################################
 
   arg        : ident COLON expr
+             { n(:Argument, *val) }
+             | ident COLON ref
              { n(:Argument, *val) }
              | expr
              { n(:Argument, *val) }
+             | ref
+             { n(:Argument, *val) }
+             ;
+
+  kv_pair    : string COLON expr
+             { n(:KeyValuePair, *val) }
+             | int COLON expr
+             { n(:KeyValuePair, *val) }
+             | string COLON ref
+             { n(:KeyValuePair, *val) }
+             | int COLON ref
+             { n(:KeyValuePair, *val) }
+             ;
+
+  kv_pairs   : kv_pair COMMA kv_pairs
+             { [val[0]] + val[2] }
+             | kv_pair COMMA
+             { [val[0]] }
+             | kv_pair
+             { [val[0]] }
              ;
 
   lval       : ident indexes
@@ -369,6 +402,10 @@ rule
              { n(:Lvalue, *val) }
              ;
 
+  ref        : AT_SIGN ident
+             { n(:Reference, val[1]) }
+             ;
+
   ##############################################################################
   # Anonymous Components
   ##############################################################################
@@ -379,6 +416,12 @@ rule
              { [val[0]] }
              ;
 
+  array_expr : LBRACE kv_pairs RBRACE
+             { n(:Array, *val) }
+             | LBRACE RBRACE
+             { n(:Array, *val) }
+             ;
+
   field      : assign_exp
              { val[0] }
              | call_exp
@@ -391,21 +434,45 @@ rule
              { nil }
              ;
 
-  idents     : ident COMMA idents
-             { [val[0]] + val[2] }
-             | ident
+  index      : LBRACK expr RBRACK
+             { val[1] }
+             | PERIOD ident
+             { val[1] }
+             ;
+
+  indexes    : index indexes
+             { [val[0]] + val[1] }
+             | index
              { [val[0]] }
              ;
 
-  indexes    : LBRACK expr RBRACK indexes
-             { [val[1]] + val[3] }
-             | LBRACK expr RBRACK
-             { [val[1]] }
+  list_elem  : expr
+             { val[0] }
+             | ref
+             { val[0] }
              ;
 
-  params     : ident COMMA params
+  list_elems : list_elem COMMA list_elems
              { [val[0]] + val[2] }
+             | list_elem
+             { [val[0]] }
+             ;
+
+  list_expr  : LBRACK list_elems RBRACK
+             { n(:List, *val) }
+             | LBRACK RBRACK
+             { n(:List, *val) }
+             ;
+
+  param      : AMPERSAND ident
+             { n(:Parameter, val[1], 'reference') }
              | ident
+             { n(:Parameter, val[0], 'value') }
+             ;
+
+  params     : param COMMA params
+             { [val[0]] + val[2] }
+             | param
              { [val[0]] }
              ;
 
@@ -415,6 +482,20 @@ rule
              { [val[0]] }
              ;
 
+  var_decl   : ident ASS_EQ expr
+             { n(:Assignment, *val) }
+             | ident ASS_EQ ref
+             { n(:Assignment, *val) }
+             | ident
+             { val[0] }
+             ;
+
+  var_decls  : var_decl COMMA var_decls
+             { [val[0]] + val[2] }
+             | var_decl
+             { [val[0]] }
+             ;
+
   ##############################################################################
   # Literals
   ##############################################################################
@@ -423,6 +504,8 @@ rule
              { n(:Identifier, *val) }
              | REP
              { n(:Identifier, *val) }
+             | IN
+             { n(:Identifier, *val) }
              ;
 
   int        : INT_DEC
@@ -456,6 +539,7 @@ end
 require 'nasl/parser/tree'
 
 require 'nasl/parser/argument'
+require 'nasl/parser/array'
 require 'nasl/parser/assigment'
 require 'nasl/parser/block'
 require 'nasl/parser/break'
@@ -477,8 +561,12 @@ require 'nasl/parser/include'
 require 'nasl/parser/increment'
 require 'nasl/parser/integer'
 require 'nasl/parser/ip'
+require 'nasl/parser/key_value_pair'
+require 'nasl/parser/list'
 require 'nasl/parser/local'
 require 'nasl/parser/lvalue'
+require 'nasl/parser/parameter'
+require 'nasl/parser/reference'
 require 'nasl/parser/repeat'
 require 'nasl/parser/repetition'
 require 'nasl/parser/return'