Re:A Brutal Look at Balanced Parentheses, Computing Machines...
by spc476 on Saturday February 23, 2019 @01:52AM
(#19232101)
Are you talking about the interview script, or the programming script? And what if the interviewee brings out Lua and LPEG [1]:
local lpeg = require "lpeg"
local balance = lpeg.Cmt(
lpeg.P {
(
(lpeg.P(1) - lpeg.S"()[]{}<>")
+ lpeg.P"(" * lpeg.V(1) * lpeg.P")"
+ lpeg.P"{" * lpeg.V(1) * lpeg.P"}"
+ lpeg.P"[" * lpeg.V(1) * lpeg.P"]"
+ lpeg.P"<" * lpeg.V(1) * lpeg.P">"
)^0
},
function(subject,position,capture)
return position,position > #subject
end
)
print(balance:match "") -- true
print(balance:match "()") -- true
print(balance:match "((()))") -- true
print(balance:match "()()()") -- true
print(balance:match "()(())") -- true
print(balance:match "(") -- false
print(balance:match "(()") -- false
print(balance:match "({)}") -- false
print(balance:match "({})") -- true
print(balance:match "()))((") -- false
[1] http://www.inf.puc-rio.br/~roberto/lpeg/lpeg.html
Re:A Brutal Look at Balanced Parentheses, Computing Machines...
by a1369209993 on Friday February 22, 2019 @08:28PM
(#19230956)
> the candidates whips Perl or Ruby or whatever out
My first thought for is_balanced_parens was something like:
while _!="" (s'()''g or reject)
#* multiple types of parentheses *#
while _!="" (s'()''g or s'{}''g or reject)
The whole script goes sideways if the candidates whips Perl or Ruby or whatever out, and provides a recursive regex.