GDK LLL -> BGF extractor

git-svn-id: https://slps.svn.sourceforge.net/svnroot/slps@785 ab42f6e0-554d-0410-b580-99e487e6eeb2

shared/tools/lll2bgf

@@ -0,0 +1,21 @@
+#!/bin/sh
+
+# Get our hands on basedir
+LOCAL1=${PWD}
+cd `dirname $0`
+cd ../..
+SLPS=${PWD}
+cd ${LOCAL1}
+
+if [ $# -lt 2 ]; then
+    echo "This tool produces a BGF grammar from a GDK's LLL grammar"
+    echo "Usage:"
+    echo "        lll2bgf [<keywords-list>] <input-lll> <output-bgf>"
+    exit 1
+elif [ ! -r $1 ]; then
+    echo "Oops: $1 not found or not readable."
+    exit 1
+elif [ $# -eq 2 ]; then
+    python ${SLPS}/topics/extraction/bnf2bgf/lll2bgf.py $1 $2
+fi
+

topics/extraction/bnf2bgf/lll2bgf.py

@@ -0,0 +1,124 @@
+#!/usr/bin/python
+# BEWARE OF QUICK AND DIRTY COPY-PASTE PROGRAMMING
+import sys
+
+grammar = {}
+order = []
+
+def bgffriendly(s):
+	return s.replace('<','&lt;').replace('>','&gt;').replace('&','&amp;')
+
+def preparelll(s):
+	return s.replace('";"','TERMINAL_SEMICOLON').replace('":"','TERMINAL_COLON').replace('"?"','TERMINAL_QUESTION')\
+			.replace('"("','TERMINAL_LEFTBRACKET').replace('")"','TERMINAL_RIGHTBRACKET').replace(')',' ) ')\
+			.replace('(',' ( ').replace(';',' ; ').replace(':',' : ').replace('?',' ? ')
+
+def serialiseExpression(ts,debug):
+	#print ts
+	s = []
+	i = 0
+	while i<len(ts):
+		if debug:
+			print 'Processing',ts[i],'(',i,')'
+		if ts[i][0] == '"':
+			s.append('<bgf:expression><terminal>'+bgffriendly(ts[i][1:-1])+'</terminal></bgf:expression>')
+			i += 1
+		elif ts[i][0] == '?':
+			s[-1]='<bgf:expression><optional>'+s[-1]+'</optional></bgf:expression>'
+			i += 1
+		elif ts[i][0] == '*':
+			s[-1]='<bgf:expression><star>'+s[-1]+'</star></bgf:expression>'
+			i += 1
+		elif ts[i][0] == '+':
+			s[-1]='<bgf:expression><plus>'+s[-1]+'</plus></bgf:expression>'
+			i += 1
+		elif ts[i][0].isalpha():
+			if ts[i]=='TERMINAL_COLON':
+				s.append('<bgf:expression><terminal>:</terminal></bgf:expression>')
+			elif ts[i]=='TERMINAL_SEMICOLON':
+				s.append('<bgf:expression><terminal>;</terminal></bgf:expression>')
+			elif ts[i]=='TERMINAL_LEFTBRACKET':
+				s.append('<bgf:expression><terminal>(</terminal></bgf:expression>')
+			elif ts[i]=='TERMINAL_RIGHTBRACKET':
+				s.append('<bgf:expression><terminal>)</terminal></bgf:expression>')
+			elif ts[i]=='TERMINAL_QUESTION':
+				s.append('<bgf:expression><terminal>?</terminal></bgf:expression>')
+			else:
+				s.append('<bgf:expression><nonterminal>'+ts[i]+'</nonterminal></bgf:expression>')
+			i += 1
+		elif ts[i] == '{':
+			if i+4>len(ts) or ts[i+3]!='}' or ts[i+4] not in ['+','*']:
+				print 'Error: incomplete separator sequence detected, processed as a terminal symbol!'
+				s.append('<bgf:expression><terminal>{</terminal></bgf:expression>')
+				i += 1
+				continue
+			symbol    = serialiseExpression([ts[i+1]],debug)
+			separator = serialiseExpression([ts[i+2]],debug)
+			if ts[i+4] == '+':
+				s.append('<bgf:expression><sequence>'+symbol+'<bgf:expression><star><bgf:expression><sequence>'+separator+symbol+'</sequence></bgf:expression></star></bgf:expression></sequence></bgf:expression>')
+			elif ts[i+4] == '*':
+				s.append('<bgf:expression><optional><bgf:expression><sequence>'+symbol+'<bgf:expression><star><bgf:expression><sequence>'+separator+symbol+'</sequence></bgf:expression></star></bgf:expression></sequence></bgf:expression></optional></bgf:expression>')
+			i += 5
+		elif ts[i] == '(':
+			rbr = i+ts[i:].index(')')
+			if debug:
+				print 'Brackets found: from',i,'to',rbr,'in',ts
+			s.append('\t'+serialiseExpression(ts[i+1:rbr],debug))
+			i = rbr+1
+		else:
+			s.append('<unknown>'+ts[i]+'</unknown>')
+			i += 1
+	# return result
+	if debug:
+		print s
+	if len(s)==1:
+		return '\t'+s[0]
+	exprs = ''.join(s)
+	if exprs.find('<unknown>|</unknown>')<0:
+		# sequence
+		return '<bgf:expression><sequence>'+exprs+'</sequence></bgf:expression>'
+	else:
+		# choice
+		choices = exprs.split('<unknown>|</unknown>')
+		for i in range(0,len(choices)):
+			if choices[i].count('<bgf:expression>')>1:
+				# remember about possibility of choices of sequences!
+				choices[i] = '<bgf:expression><sequence>'+choices[i]+'</sequence></bgf:expression>'
+		return '<bgf:expression><choice>'+''.join(choices)+'</choice></bgf:expression>'
+	print 'Warning: default output'
+	return '\n\t'.join(s)
+
+def serialiseFormula(name,tokens):
+	print 'Processing',name,'...'
+	if name=='BREAKPOINT':
+		print tokens
+		return '<bgf:production><nonterminal>'+name+'</nonterminal>'+serialiseExpression(tokens,True)+'</bgf:production>'
+	return '<bgf:production><nonterminal>'+name+'</nonterminal>'+serialiseExpression(tokens,False)+'</bgf:production>'
+
+def lll2lines(f1,f2):
+	lll = open(f1,'r')
+	bgf = open(f2,'w')
+	bulk = preparelll(' '.join(filter(lambda x:x[0]!='#',lll.readlines()))).split()
+	bgf.write('<bgf:grammar xmlns:bgf="http://planet-sl.org/bgf">')
+	while bulk!=[] and bulk.index(';'):
+		if bulk[1] != ':':
+			print 'error'
+			print bulk
+			break
+		bgf.write(serialiseFormula(bulk[0],bulk[2:bulk.index(';')]))
+		bulk = bulk[(bulk.index(';')+1):]
+	bgf.write('</bgf:grammar>')
+	lll.close()
+	bgf.close()
+	return
+
+if __name__ == "__main__":
+ print 'LLL to BNF-like Grammar Format automated extractor'
+ if len(sys.argv) == 3:
+  print 'Reading the LLL...'
+  lll2lines(sys.argv[1],sys.argv[2])
+  sys.exit(0)
+ else:
+  print 'Usage:'
+  print ' ',sys.argv[0],'''<input> <output>'''
+  sys.exit(1)