hg/stx-goodies-petitparser: comparison PPComposedTest.st

equal deleted inserted replaced

-:57c26569b92b
+:d72aa40bcf53
 ! !
 !PPComposedTest methodsFor:'testing'!
 testDoubledString
-	| parser |
+| parser |
-	parser := ($' asParser , (($' asParser , $' asParser) / $' asParser negate) star flatten , $' asParser)
+parser := ($' asParser , (($' asParser , $' asParser) / $' asParser negate) star flatten , $' asParser)
-		==> [ :nodes | nodes second copyReplaceAll: '''''' with: '''' ].
+==> [ :nodes | nodes second copyReplaceAll: '''''' with: '''' ].
-	self assert: parser parse: '''''' to: ''.
+self assert: parser parse: '''''' to: ''.
-	self assert: parser parse: '''a''' to: 'a'.
+self assert: parser parse: '''a''' to: 'a'.
-	self assert: parser parse: '''ab''' to: 'ab'.
+self assert: parser parse: '''ab''' to: 'ab'.
-	self assert: parser parse: '''a''''b''' to: 'a''b'.
+self assert: parser parse: '''a''''b''' to: 'a''b'.
-	self assert: parser parse: '''a''''''''b''' to: 'a''''b'
+self assert: parser parse: '''a''''''''b''' to: 'a''''b'
 "Modified: / 18-12-2010 / 18:00:16 / Jan Kurs <kurs.jan@post.cz>"
 !
 testEvenNumber
 	"Create a grammar that parses an even number of a's and b's."
 	| a as b bs s |
 	a := $a asParser ==> [ :char | as := as + 1 ].
 	b := $b asParser ==> [ :char | bs := bs + 1 ].
 	s := (a / b) star >=> [ :stream :cc |
 		as := bs := 0.
 	self assert: s fail: 'ba' end: 2.
 	self assert: s fail: 'aaa' end: 3.
 	self assert: s fail: 'bbb' end: 3.
 	self assert: s fail: 'aab' end: 3.
 	self assert: s fail: 'abb' end: 3.
 	self assert: s parse: ''.
 	self assert: s parse: 'aa'.
 	self assert: s parse: 'bb'.
 	self assert: s parse: 'aaaa'.
 	self assert: s parse: 'aabb'.
 	self assert: parser fail: 'if C then if C'
 !
 testLeftRecursion
 	"S ::= S 'x' S / '1'"
 	| parser |
 	parser := PPUnresolvedParser new.
 	parser def: ((parser , $x asParser , parser) / $1 asParser) memoized flatten.
 	self assert: parser parse: '1' to: '1'.
 	self assert: parser parse: '1x1x1x1x1x1' to: '1x1x1x1x1x1'
 !
 testListOfIntegers
 	"S ::= S , number | number"
 	| number list parser |
 	number := #digit asParser plus token trim
 		==> [ :node | node value asInteger ].
 	list := (number separatedBy: $, asParser token trim)
 		==> [ :node | node select: [ :each | each isInteger ] ].
 	self assert: parser parse: '1' to: (1 to: 1) asArray.
 	self assert: parser parse: '1 ,2' to: (1 to: 2) asArray.
 	self assert: parser parse: '1 ,2 ,3' to: (1 to: 3) asArray.
 	self assert: parser parse: '1 ,2 ,3 ,4' to: (1 to: 4) asArray.
 	self assert: parser parse: '1 ,2 ,3 ,4 ,5' to: (1 to: 5) asArray.
 	self assert: parser fail: ''.
 	self assert: parser fail: ','.
 	self assert: parser fail: '1,'.
 	self assert: parser fail: '1,,2'
 !
 	"C ::= B I* E"
 	"I ::= !!E (C | T)"
 	"B ::= /*"
 	"E ::= */"
 	"T ::= ."
 	| begin end any inside parser |
 	begin := '/*' asParser.
 	end := '*/' asParser.
 	any := #any asParser.
 	parser := PPUnresolvedParser new.
 	inside := end not , (parser / any).
 	parser def: begin , inside star , end.
 	self assert: parser parse: '/*ab*/cd' end: 6.
 	self assert: parser parse: '/*a/*b*/c*/'.
 	self assert: parser fail: '/*a/*b*/c'
 !
 testPalindrome
 	"S0 ::= a S1 a | b S1 b | ...
 	 S1 ::= S0 | epsilon"
 	| s0 s1 parser |
 	s0 := PPUnresolvedParser new.
 	s1 := PPUnresolvedParser new.
 	s0 def: ($a asParser , s1 , $a asParser)
 		/ ($b asParser , s1 , $b asParser)
 		/ ($c asParser , s1 , $c asParser).
 	s1 def: s0 / nil asParser.
 	parser := s0 flatten end.
 	self assert: parser parse: 'aa' to: 'aa'.
 	self assert: parser parse: 'bb' to: 'bb'.
 	self assert: parser parse: 'cc' to: 'cc'.
 	self assert: parser parse: 'abba' to: 'abba'.
 	self assert: parser parse: 'baab' to: 'baab'.
 	self assert: parser parse: 'abccba' to: 'abccba'.
 	self assert: parser parse: 'abaaba' to: 'abaaba'.
 !
 testParseAaaBbb
 	"S0 ::= a S1 b
 	 S1 ::= S0 | epsilon"
 	| s0 s1 parser |
 	s0 := PPUnresolvedParser new.
 	s1 := PPUnresolvedParser new.
 	s0 def: $a asParser , s1 , $b asParser.
 	s1 def: s0 / nil asParser.
 	self assert: parser fail: 'aaabb'
 !
 testParseAaaaaa
 	"S ::= a a S | epsilon"
 	| s0 s1 parser |
 	s0 := PPUnresolvedParser new.
 	s1 := $a asParser , $a asParser , s0.
 	s0 def: s1 / nil asParser.
 	parser := s0 flatten.
 	self assert: parser parse: 'aaaaaaa' to: 'aaaaaa' end: 6
 !
 testParseAbAbAb
 	"S ::= (A B)+"
 	| parser |
 	parser := ($a asParser , $b asParser) plus flatten.
 	self assert: parser parse: 'ab' to: 'ab'.
 	self assert: parser parse: 'abab' to: 'abab'.
 	self assert: parser parse: 'abb' to: 'ab' end: 2.
 	self assert: parser parse: 'ababa' to: 'abab' end: 4.
 	self assert: parser parse: 'abababb' to: 'ababab' end: 6.
 	self assert: parser parse: 'ababababa' to: 'abababab' end: 8.
 	self assert: parser fail: ''.
 	self assert: parser fail: 'a'.
 	self assert: parser fail: 'bab'
 !
 	self assert: parser parse: 'ac' to: 'a' end: 1.
 	self assert: parser parse: 'bc' to: 'b' end: 1.
 	self assert: parser parse: 'abc' to: 'ab' end: 2.
 	self assert: parser parse: 'bac' to: 'ba' end: 2.
 	self assert: parser fail: ''.
 	self assert: parser fail: 'c'
 !
 testParseAnBnCn
 	"PEGs for a non context- free language:
 		a^n , b^n , c^n
 	S <- &P1 P2
 	P1 <- AB 'c'
 	AB <- 'a' AB 'b' / epsilon
 	P2 <- 'a'* BC end
 	BC <- 'b' BC 'c' / epsilon"
 	| s p1 ab p2 bc |
 	s := PPUnresolvedParser new.
 	p1 := PPUnresolvedParser new.
 	ab := PPUnresolvedParser new.
 	p2 := PPUnresolvedParser new.
 	bc := PPUnresolvedParser new.
 	s def: (p1 and , p2 end) flatten.
 	p1 def: ab , $c asParser.
 	ab def: ($a asParser , ab , $b asParser) optional.
 	p2 def: $a asParser star , bc.
 	bc def: ($b asParser , bc , $c asParser) optional.
 	self assert: s parse: 'abc' to: 'abc'.
 	self assert: s parse: 'aabbcc' to: 'aabbcc'.
 	self assert: s parse: 'aaabbbccc' to: 'aaabbbccc'.
 	self assert: s fail: 'bc'.
 	self assert: self number parse: '1..' to: '1' end: 1.
 	self assert: self number parse: '12-' to: '12' end: 2.
 	self assert: self number parse: '12.3.' to: '12.3' end: 4.
 	self assert: self number parse: '12.34.' to: '12.34' end: 5.
 	self assert: self number parse: '-1' to: '-1'.
 	self assert: self number parse: '-12' to: '-12'.
 	self assert: self number parse: '-12.3' to: '-12.3'.
 	self assert: self number parse: '-12.34' to: '-12.34'.
 	self assert: self number fail: ''.
 	self assert: self number fail: '-'.
 	self assert: self number fail: '.'.
 	self assert: self number fail: '.1'
 !
 	self assert: return parse: '^1' to: #(return '1').
 	self assert: return parse: '^12' to: #(return '12').
 	self assert: return parse: '^ 123' to: #(return '123').
 	self assert: return parse: '^  1234' to: #(return '1234').
 	self assert: return fail: '1'.
 	self assert: return fail: '^'
 ! !
 !PPComposedTest class methodsFor:'documentation'!
+version
+^ '$Header: /cvs/stx/stx/goodies/petitparser/PPComposedTest.st,v 1.3 2012-05-04 21:59:40 vrany Exp $'
+!
+version_CVS
+^ '$Header: /cvs/stx/stx/goodies/petitparser/PPComposedTest.st,v 1.3 2012-05-04 21:59:40 vrany Exp $'
+!
 version_SVN
-^ '$Id: PPComposedTest.st,v 1.2 2012-01-13 11:22:50 cg Exp $'
+^ '�Id: PPComposedTest.st 4 2010-12-18 17:02:23Z kursjan �'
 ! !

changeset 14	d72aa40bcf53
parent 4	90de244a7fa2
child 96	b3a69699d996