nitlanguage
/
nit.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
src: transform all old writable in annotations
[nit.git]
/
lib
/
nitcc_runtime.nit
diff --git
a/lib/nitcc_runtime.nit
b/lib/nitcc_runtime.nit
index
5f05815
..
74dcd43
100644
(file)
--- a/
lib/nitcc_runtime.nit
+++ b/
lib/nitcc_runtime.nit
@@
-99,7
+99,7
@@
abstract class Parser
# The current state
# Used by generated parsers
# The current state
# Used by generated parsers
- var state: LRState
+ var state: LRState is noinit
init
do
init
do
@@
-116,7
+116,7
@@
abstract class Parser
# Should the parser stop
# Used by generated parsers
# Should the parser stop
# Used by generated parsers
- var stop writable = true
+ var stop = true is writable
# Parse a full sequence of tokens and return a complete syntactic tree
fun parse: Node
# Parse a full sequence of tokens and return a complete syntactic tree
fun parse: Node
@@
-318,7
+318,7
@@
abstract class Node
end
# The position of the node in the input stream
end
# The position of the node in the input stream
- var position: nullable Position writable = null
+ var position: nullable Position = null is writable
# Produce a graphiz file for the syntaxtic tree rooted at `self`.
fun to_dot(filepath: String)
# Produce a graphiz file for the syntaxtic tree rooted at `self`.
fun to_dot(filepath: String)
@@
-423,7
+423,7
@@
abstract class NToken
end
# The text associated with the token
end
# The text associated with the token
- var text: String writable = ""
+ var text: String = "" is writable
redef fun to_s do
var res = super
redef fun to_s do
var res = super
@@
-473,8
+473,9
@@
end
# A parser error linked to a unexpected token
class NParserError
super NError
# A parser error linked to a unexpected token
class NParserError
super NError
+
# The unexpected token
# The unexpected token
- var token: nullable NToken
+ var token: nullable NToken = null
redef fun unexpected
do
redef fun unexpected
do
@@
-490,7
+491,7
@@
end
# A hogeneous sequence of node, used to represent unbounded lists (and + modifier)
class Nodes[T: Node]
super Node
# A hogeneous sequence of node, used to represent unbounded lists (and + modifier)
class Nodes[T: Node]
super Node
- redef var children = new Array[T]
+ redef var children: Array[T] = new Array[T]
end
# A production with a specific, named and statically typed children
end
# A production with a specific, named and statically typed children
@@
-550,7
+551,7
@@
abstract class TestParser
var filepath = args.shift
var text
if filepath == "-" then
var filepath = args.shift
var text
if filepath == "-" then
- text = stdin.read_all
+ text = sys.stdin.read_all
else if filepath == "-e" then
if args.is_empty then
print "Error: -e need a text"
else if filepath == "-e" then
if args.is_empty then
print "Error: -e need a text"