Unlock 30% off on Manual Testing Annual Plans this Holiday Season.

Copied to Clipboard!

How to use finalState method in avocado

Best Python code snippet using avocado_python

main.py

Source:main.py

1class Variable:2    def __init__(self, exp):3        self.var = exp4    def __str__(self):5        return f"{self.var}"6class Concat:7    def __init__(self, expr1, expr2):8        self.expr1 = expr19        self.expr2 = expr210    def __str__(self):11        return f"Concat({self.expr1}, {self.expr2})"12class Union:13    def __init__(self, expr1, expr2):14        self.expr1 = expr115        self.expr2 = expr216    def __str__(self):17        return f"Union({self.expr1}, {self.expr2})"18class Star:19    def __init__(self, expr):20        self.expr = expr21    def __str__(self):22        return f"Star({self.expr})"23class Plus:24    def __init__(self, expr):25        self.expr = expr26    def __str__(self):27        return f"Plus({self.expr})"28#--------------------------------------------------------------------------------29def verifInitialized(exp):30    if isinstance(exp, Concat):31        if exp.expr1 != "?" and exp.expr2 != "?":32            return True33    if isinstance(exp, Union):34        if exp.expr1 != "?" and exp.expr2 != "?":35            return True36    if isinstance(exp, Plus):37        if exp.expr != "?":38            return True39    if isinstance(exp, Star):40        if exp.expr != "?":41            return True42    return False43#puts all the paranteses to the regex and creates the necessary classes44def parse(string):45    stack = []46    while string:47        if string.startswith('CONCAT '):48            string = string[len('CONCAT '):]49            stack.append(Concat("?", "?"))50        elif string.startswith('STAR '):51            string = string[len('STAR '):]52            stack.append(Star("?"))53        elif string.startswith('UNION '):54            string = string[len('UNION '):]55            stack.append(Union("?", "?"))56        elif string.startswith('PLUS '):57            string = string[len('PLUS '):]58            stack.append(Plus("?"))59        elif not stack:60            stack.append(Variable(string))61            break62        else:63            elems = string[0]64            string = string[len(elems[0]) + 1:]65            if isinstance(stack[-1], Union):66                if stack[-1].expr1 == "?":67                    stack[-1].expr1 = Variable(elems[0])68                elif stack[-1].expr2 == "?":69                    stack[-1].expr2 = Variable(elems[0])70            if isinstance(stack[-1], Concat):71                if stack[-1].expr1 == "?":72                    stack[-1].expr1 = Variable(elems[0])73                elif stack[-1].expr2 == "?":74                    stack[-1].expr2 = Variable(elems[0])75            if isinstance(stack[-1], Star):76                if stack[-1].expr == "?":77                    stack[-1].expr = Variable(elems[0])78            if isinstance(stack[-1], Plus):79                if stack[-1].expr == "?":80                    stack[-1].expr = Variable(elems[0])81            while verifInitialized(stack[-1]) and (len(stack) != 1):82                if isinstance(stack[-2], Union):83                    if stack[-2].expr1 == "?":84                        stack[-2].expr1 = stack[-1]85                    elif stack[-2].expr2 == "?":86                        stack[-2].expr2 = stack[-1]87                if isinstance(stack[-2], Concat):88                    if stack[-2].expr1 == "?":89                        stack[-2].expr1 = stack[-1]90                    elif stack[-2].expr2 == "?":91                        stack[-2].expr2 = stack[-1]92                if isinstance(stack[-2], Star):93                    if stack[-2].expr == "?":94                        stack[-2].expr = stack[-1]95                if isinstance(stack[-2], Plus):96                    if stack[-2].expr == "?":97                        stack[-2].expr = stack[-1]98                stack.pop()99    stackFinal = stack[0]100    stack.pop()101    return stackFinal102#------------------------------------------------------------------------------------------103class NFA:104    def __init__(self, alphabet, initialState, finalState, deltaFunction):105        self.alphabet = alphabet106        self.initialState = initialState107        self.finalState = finalState108        self.deltaFunction = deltaFunction109    def __str__(self):110        return  (f"alphabet: {self.alphabet} \n"111                f"initial state: {self.initialState} \n"112                f"final state: {self.finalState} \n"113                f"delta function: {self.deltaFunction}")114def printList(l):115    out = ''116    for x in l:117        out += str(x) + " "118    out = out[:-1]119    return out120def printDic(dict):121    out = ''122    for key in dict:123        out += str(key[0]) + ",'" + str(key[1]) + "'," + str(dict[key]) + "\n"124    out = out[:-1]125    return out126class DFA:127    def __init__(self, alphabet, nrStates, initialState, finalState, deltaFunction):128        self.nrStates = nrStates129        self.alphabet  = alphabet130        self.initialState = initialState131        self.finalState = finalState132        self.deltaFunction = deltaFunction133    def __str__(self):134        return (f"{listToNumber(self.alphabet)}\n"135                f"{self.nrStates}\n"136                f"{self.initialState}\n"137                f"{printList(self.finalState)}\n"138                f"{printDic(self.deltaFunction)}")139#------------------------------------------------------------------------------------------140#recursive function to determine the NFA for the given expression141def regexToNfa(ourNFA, expression):142    if isinstance(expression, Variable):143        if ourNFA.initialState == -1 and ourNFA.finalState == -1:144            ourNFA.alphabet = [expression.var]145            ourNFA.initialState = 0146            ourNFA.finalState = 1147            ourNFA.deltaFunction[(ourNFA.initialState, expression.var)] = ourNFA.finalState148    if isinstance(expression, Star):149        ourNFA = regexToNfa(ourNFA, expression.expr)150        newDict = {}151        for x in ourNFA.deltaFunction:152            newDict[(x[0] + 1, x[1])] = ourNFA.deltaFunction[x] + 1153        ourNFA.deltaFunction = newDict154        ourNFA.initialState += 1155        ourNFA.finalState += 1156        ourNFA.deltaFunction[(ourNFA.initialState - 1, "epsilon1")] = ourNFA.initialState157        ourNFA.deltaFunction[(ourNFA.finalState, "epsilon1")] = ourNFA.finalState + 1158        ourNFA.deltaFunction[(ourNFA.initialState-1, "epsilon2")] = ourNFA.finalState + 1159        ourNFA.deltaFunction[(ourNFA.finalState,  "epsilon2")] = ourNFA.initialState160        ourNFA.initialState -=1161        ourNFA.finalState += 1162    if isinstance(expression, Concat):163        NFAaux1 = regexToNfa(NFA([], -1, -1, {}), expression.expr1)164        NFAaux2 = regexToNfa(NFA([], -1, -1, {}), expression.expr2)165        ourNFA.alphabet = NFAaux2.alphabet + NFAaux1.alphabet166        newDict = {}167        for x in NFAaux2.deltaFunction:168            newDict[(x[0] + NFAaux1.finalState + 1, x[1])] = NFAaux2.deltaFunction[x] + NFAaux1.finalState + 1169        NFAaux2.initialState += NFAaux1.finalState + 1170        NFAaux2.finalState += NFAaux1.finalState + 1171        NFAaux2.deltaFunction = newDict172        ourNFA.deltaFunction.update(NFAaux1.deltaFunction)173        ourNFA.deltaFunction.update(NFAaux2.deltaFunction)174        ourNFA.deltaFunction[(NFAaux1.finalState, "epsilon")] = NFAaux2.initialState175        ourNFA.initialState = NFAaux1.initialState176        ourNFA.finalState = NFAaux2.finalState177    if isinstance(expression, Plus):178        ourNFA = regexToNfa(ourNFA, expression.expr)179        copie = regexToNfa(NFA([], -1, -1, {}), expression.expr)180        newDict = {}181        for x in copie.deltaFunction:182            newDict[(x[0] + 1, x[1])] = copie.deltaFunction[x] + 1183        copie.deltaFunction = newDict184        copie.initialState += 1185        copie.finalState += 1186        copie.deltaFunction[(copie.initialState - 1, "epsilon1")] = copie.initialState187        copie.deltaFunction[(copie.finalState, "epsilon1")] = copie.finalState + 1188        copie.deltaFunction[(copie.initialState - 1, "epsilon2")] = copie.finalState + 1189        copie.deltaFunction[(copie.finalState, "epsilon2")] = copie.initialState190        copie.initialState -= 1191        copie.finalState += 1192        # --------------------------------------------------------------------------193        newDict = {}194        for x in copie.deltaFunction:195            newDict[(x[0] + ourNFA.finalState + 1, x[1])] = copie.deltaFunction[x] + ourNFA.finalState + 1196        copie.deltaFunction = newDict197        copie.initialState += ourNFA.finalState + 1198        copie.finalState += ourNFA.finalState + 1199        #---------------------------------------------------------------------------200        #concatenate the two dict201        ourNFA.deltaFunction.update(copie.deltaFunction)202        ourNFA.deltaFunction[(ourNFA.finalState, "epsilon")] = copie.initialState203        ourNFA.finalState = copie.finalState204    if isinstance(expression, Union):205        NFAaux1 = regexToNfa(NFA([],-1, -1, {}), expression.expr1)206        NFAaux2 = regexToNfa(NFA([],-1, -1, {}), expression.expr2)207        ourNFA.alphabet = NFAaux2.alphabet + NFAaux1.alphabet208        newDict = {}209        for x in NFAaux2.deltaFunction:210            newDict[(x[0] + NFAaux1.finalState + 1, x[1])] = NFAaux2.deltaFunction[x] + NFAaux1.finalState + 1211        NFAaux2.deltaFunction =newDict212        NFAaux2.initialState += NFAaux1.finalState + 1213        NFAaux2.finalState += NFAaux1.finalState + 1214        newDict = {}215        for x in NFAaux1.deltaFunction:216            newDict[(x[0] + 1, x[1])] = NFAaux1.deltaFunction[x] + 1217        NFAaux1.deltaFunction = newDict218        NFAaux1.initialState += 1219        NFAaux1.finalState += 1220        newDict = {}221        for x in NFAaux2.deltaFunction:222            newDict[(x[0] + 1, x[1])] = NFAaux2.deltaFunction[x] + 1223        NFAaux2.deltaFunction = newDict224        NFAaux2.initialState += 1225        NFAaux2.finalState += 1226        ourNFA.deltaFunction.update(NFAaux1.deltaFunction)227        ourNFA.deltaFunction.update(NFAaux2.deltaFunction)228        ourNFA.initialState = 0229        ourNFA.finalState = NFAaux2.finalState + 1230        ourNFA.deltaFunction[(ourNFA.initialState,"epsilon1")] = NFAaux1.initialState231        ourNFA.deltaFunction[(ourNFA.initialState, "epsilon2")] = NFAaux2.initialState232        ourNFA.deltaFunction[(NFAaux1.finalState, "epsilon1")] = ourNFA.finalState233        ourNFA.deltaFunction[(NFAaux2.finalState, "epsilon2")] = ourNFA.finalState234    return ourNFA235#-----------------------------------------------------------------------------------------236class costGraphElement:237    def __init__(self, currentState, cost, possibleNextStates):238        self.currentState = currentState239        self.cost = cost240        self.possibleNextStates =possibleNextStates241    def __str__(self):242        return f"{self.currentState} -> cost: {self.cost} -> {self.possibleNextStates}"243#verify if element exists in graph244def finndInGraph(graph, state, cost):245    if len(graph) != 0:246        for i in range(len(graph)):247            if graph[i].currentState == state and graph[i].cost == cost:248                return i249    return -1250#convert NFA deltafunction into a cost graph251def NFAtoCostGraph(ourNFA):252    graph = []253    for x in ourNFA.deltaFunction:254        if x[1].startswith("epsilon"):255            idx = finndInGraph(graph, x[0], "epsilon")256        else:257            idx = finndInGraph(graph, x[0], x[1])258        if idx == -1:259            if x[1].startswith("epsilon"):260                graph.append(costGraphElement(x[0], "epsilon", [ourNFA.deltaFunction[(x[0], x[1])]]))261            else:262                graph.append(costGraphElement(x[0], x[1], [ourNFA.deltaFunction[(x[0],x[1])]]))263        else:264            graph[idx].possibleNextStates.append(ourNFA.deltaFunction[(x[0], x[1])])265    return graph266#-----------------------------------------------------------------------------------------267#function to determine the epsilon closure for a state268def epsClosure(graf, state):269    visited = []  # Set to keep track of visited nodes.270    visited = dfa(visited, graf, state)271    visited = list(dict.fromkeys(visited))272    visited.sort()273    return visited274def epsClosureOnInput (graf, state, imp):275    idx = finndInGraph(graf, state, imp)276    visited = []277    if idx != -1:278        for x in graf[idx].possibleNextStates:279            visited += epsClosure(graf, x)280    visited = list(dict.fromkeys(visited))281    visited.sort()282    return visited283def dfa(visited, graf, state):284    if state not in visited:285        visited.append(state)286        idx = finndInGraph(graf, state, "epsilon")287        if idx != -1:288            for neighbour in graf[idx].possibleNextStates:289                dfa(visited,graf, neighbour)290    return visited291def listToNumber(list):292    num = ''293    list.sort()294    for x in list:295        num += str(x)296    return num297#function to determine the DFA when the NFA is known298def NFAtoDFA(graph, alphabet, finalState):299    nrStates = 0300    ourDFA = DFA(alphabet, 0, -1, [], {})301    statesDiscovered = []302    remainedToStudy = []303    for x in alphabet:304        ourDFA.deltaFunction[(nrStates, x)] = nrStates305    statesDiscovered.append(nrStates)306    firstState = epsClosure(graph, 0)307    #copie = listToNumber(firstState)308    nrStates += 1309    ourDFA.initialState = nrStates310    if finalState in firstState:311        ourDFA.finalState.append(nrStates)312    remainedToStudy.append(firstState)313    statesDiscovered.append(firstState)314    #while there are still states remained not studied315    while remainedToStudy:316        toStudy = remainedToStudy[-1]317        currState = statesDiscovered.index(remainedToStudy[-1])318        nextToDelete = len(remainedToStudy) -1319        #for each possible input320        for x in alphabet:321            newState = []322            #generate the eps transition for current dfa state323            for y in toStudy:324                idx = finndInGraph(graph, y, x)325                if idx != -1:326                    newState += epsClosureOnInput(graph, y, x)327            if newState:328                #if a state was generated329                newState = list(dict.fromkeys(newState))330                newState.sort()331                #if state has already been discovered332                if newState in statesDiscovered:333                    idx = statesDiscovered.index(newState)334                    ourDFA.deltaFunction[(currState, x)] = idx335                else:336                    nrStates += 1337                    remainedToStudy.append(newState)338                    statesDiscovered.append(newState)339                    ourDFA.deltaFunction[(currState, x)] = nrStates340                    if finalState in newState:341                        ourDFA.finalState.append(nrStates)342            else:343                #current state will go into a sink with that input344                ourDFA.deltaFunction[(currState, x)] = 0345        remainedToStudy.pop(nextToDelete)346        ourDFA.nrStates = len(statesDiscovered)347    return ourDFA348#-----------------------------------------------------------------------------------------349import sys350def main():351    args = sys.argv[1:]352    f = open(args[0], "r")353    #read input from file354    input = f.read()355    #parse the input356    expression = parse(input)357    #determine the NFA358    ourNFA = regexToNfa(NFA([], -1, -1, {}), expression)359    alphabet = list(dict.fromkeys(ourNFA.alphabet))360    #transform the NFA into a graph361    graf = NFAtoCostGraph(ourNFA)362    #determine the DFA363    ourDFA = NFAtoDFA(graf, alphabet, ourNFA.finalState)364    foutput = args[1]365    f = open(foutput, "w")366    f.write(str(ourDFA))367    f.close()368if __name__ == "__main__":...

smdsl_parser.py

Source:smdsl_parser.py

1import copy2from pyparsing import CaselessKeyword, Suppress, Word, CaselessLiteral, alphas, alphanums, delimitedList, Group, \3    OneOrMore, ZeroOrMore, Optional, cppStyleComment4from robocompdsl.dsl_parsers.dsl_parser_abstract import DSLParserTemplate5# noinspection PyTypeChecker6class SMDSLParser(DSLParserTemplate):7    def __init__(self):8        super(SMDSLParser, self).__init__()9    def _create_parser(self):10        (TRANSITIONS, INITIAL_STATE, END_STATE, STATES, PARALLEL) = list(map(CaselessKeyword, """11                		transitions initial_state end_state states parallel""".split()))12        semicolon = Suppress(Word(";"))13        op = Suppress(Word("{"))14        cl = Suppress(Word("}"))15        to = Suppress(CaselessLiteral("=>"))16        identifier = Word(alphas + "_", alphanums + "_")17        list_identifiers = delimitedList(identifier)18        # parse States19        stateslist = Group(Suppress(STATES) + list_identifiers + semicolon).setResultsName('states')20        # parse Transitions21        transition = identifier.setResultsName('src') + to + list_identifiers.setResultsName('dests') + semicolon22        transitions_list = Group(OneOrMore(Group(transition))).setResultsName("transitions")23        transitions = Suppress(TRANSITIONS) + op + transitions_list + cl + semicolon24        # parse initialstate and finalstate25        initialstate = Suppress(INITIAL_STATE) + identifier.setResultsName('initialstate') + semicolon26        finalstate = Suppress(END_STATE) + identifier.setResultsName('finalstate') + semicolon27        # parse machine28        contents = stateslist | initialstate | finalstate | transitions29        machine_content = op + ZeroOrMore(contents) + cl + semicolon30        parent = Suppress(Word(":")) + identifier.setResultsName('parent')31        substate = parent + Optional(PARALLEL.setResultsName('parallel').setParseAction(lambda t: True)) + Group(32            machine_content).setResultsName("contents")33        machine = identifier.setResultsName("name") + Group(machine_content).setResultsName("contents") + Group(34            ZeroOrMore(Group(substate))).setResultsName("substates")35        SMDSL = Group(machine.ignore(cppStyleComment)).setResultsName("machine")36        return SMDSL37    def string_to_struct(self, string, **kwargs):38        parsing_result = self.parse_string(string)39        result_dict = {'machine': {}}40        # Horrible hack to make robocompdsl work with pyparsing > 2.241        try:42            result_dict['machine']['name'] = parsing_result['machine']['name']43        except KeyError:44            result_dict['machine']['name'] = parsing_result['name']45            parsing_result['machine'] = copy.deepcopy(parsing_result)46        if result_dict['machine']['name'] == "defaultMachine":47            result_dict['machine']['default'] = True48        else:49            result_dict['machine']['default'] = False50        result_dict['machine']['contents'] = {}51        try:52            result_dict['machine']['contents']['states'] = parsing_result['machine']['contents']['states'].asList()53        except KeyError:54            result_dict['machine']['contents']['states'] = None55        try:56            result_dict['machine']['contents']['finalstate'] = parsing_result['machine']['contents']['finalstate']57        except KeyError:58            result_dict['machine']['contents']['finalstate'] = None59        else:60            if result_dict['machine']['contents']['states'] is not None:61                for state in result_dict['machine']['contents']['states']:62                    if result_dict['machine']['contents']['finalstate'] == state:63                        print(("Error: this final state " + result_dict['machine']['contents']['finalstate'] + " is in states"))64        try:65            result_dict['machine']['contents']['initialstate'] = parsing_result['machine']['contents']['initialstate']66        except KeyError:67            print("Error: The state machine needs initial state")68        else:69            if result_dict['machine']['contents']['states'] is not None:70                for state in result_dict['machine']['contents']['states']:71                    if result_dict['machine']['contents']['initialstate'] == state:72                        print(("Error: this initial state " + result_dict['machine']['contents'][73                            'initialstate'] + " is in states"))74            if result_dict['machine']['contents']['finalstate'] is not None:75                if result_dict['machine']['contents']['initialstate'] == result_dict['machine']['contents']['finalstate']:76                    print("Error: initial state is equal final state")77        result_dict['machine']['contents']['transitions'] = []78        try:79            for transition in parsing_result['machine']['contents']['transitions']:80                result_dict['machine']['contents']['transitions'].append(transition.asDict())81        except KeyError:82            result_dict['machine']['contents']['transitions'] = None83        try:84            result_dict['substates'] = []85        except KeyError:86            result_dict['substates'] = None87        if result_dict['substates'] is not None:88            for sub in parsing_result['machine']['substates']:89                a = {}90                # a['name'] = sub['name']91                try:92                    a['parallel'] = sub['parallel']93                except KeyError:94                    a['parallel'] = False95                try:96                    a['parent'] = sub['parent']97                except KeyError:98                    print("Error: substate missing parent")99                    # TODO: Raise exception. Don't Exit.100                    raise KeyError("Substate must have a parent %s" % str(sub))101                a['contents'] = {}102                if a['parallel']:103                    try:104                        a['contents']['states'] = sub['contents']['states']105                    except KeyError:106                        print(("Error: substate " + a['parent'] + " missing states"))107                    try:108                        a['contents']['finalstate'] = sub['contents']['finalstate']109                        print(("Error substate " + a['parent'] + " can't have final state"))110                    except KeyError:111                        a['contents']['finalstate'] = None112                    try:113                        a['contents']['initialstate'] = sub['contents']['initialstate']114                        print(("Error substate " + a['parent'] + " can't have initial state"))115                    except KeyError:116                        a['contents']['initialstate'] = None117                else:118                    try:119                        a['contents']['states'] = sub['contents']['states'].asList()120                    except KeyError:121                        a['contents']['states'] = None122                    try:123                        a['contents']['finalstate'] = sub['contents']['finalstate']124                    except KeyError:125                        a['contents']['finalstate'] = None126                    else:127                        if a['contents']['states'] is not None:128                            for state in a['contents']['states']:129                                if a['contents']['finalstate'] == state:130                                    print(("Error: substate " + a['parent'] + " this final state " + a['contents'][131                                        'finalstate'] + " is in states"))132                    try:133                        a['contents']['initialstate'] = sub['contents']['initialstate']134                    except KeyError:135                        print(("Error substate " + a['parent'] + " needs initial state"))136                    else:137                        if a['contents']['states'] is not None:138                            for state in a['contents']['states']:139                                if a['contents']['initialstate'] == state:140                                    print(("Error: " + a['parent'] + " this initial state " + a['contents'][141                                        'initialstate'] + " is in states"))142                        if a['contents']['initialstate'] == a['contents']['finalstate']:143                            print(("Error: " + a['parent'] + " initial state is equal final state"))144                try:145                    a['contents']['transitions'] = []146                    for transition in sub['contents']['transitions']:147                        a['contents']['transitions'].append(transition.asDict())148                except KeyError:149                    a['contents']['transitions'] = None150                result_dict['substates'].append(a)151        self.struct = result_dict...

packet_update_jigsaw_block.py

Source:packet_update_jigsaw_block.py

1"""[!] This file is autogenerated"""2from typing import Tuple, List, Dict, Union, Optional3from ....packet import Packet4from ....definitions import *5from ....types import *6class PacketUpdateJigsawBlock(Packet):7	__slots__ = ( 'id', 'attachmentType', 'finalState', 'jointType', 'location', 'name', 'pool', 'target', 'targetPool' )8	9	attachmentType : str10	finalState : str11	jointType : str12	location : tuple13	name : str14	pool : str15	target : str16	targetPool : str17	def __init__(self, proto:int,18		attachmentType:str=None,19		finalState:str=None,20		jointType:str=None,21		location:tuple=None,22		name:str=None,23		pool:str=None,24		target:str=None,25		targetPool:str=None,26		**kwargs27	):28		super().__init__(proto,29			attachmentType=attachmentType,30			finalState=finalState,31			jointType=jointType,32			location=location,33			name=name,34			pool=pool,35			target=target,36			targetPool=targetPool37		)38	_state : int = 339	_ids : Dict[int, int] = {40		477 : 39,41		480 : 39,42		490 : 39,43		498 : 39,44		573 : 39,45		575 : 39,46		578 : 39,47		709 : 39,48		734 : 40,49		735 : 40,50		736 : 40,51		751 : 41,52		755 : 41,53		756 : 41,54		757 : 4155	}56	_definitions : Dict[int, List[Tuple[str, Type]]] = {57		477 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],58		480 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],59		490 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],60		498 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],61		573 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],62		575 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],63		578 : [ ( 'location', Position ), ( 'attachmentType', String ), ( 'targetPool', String ), ( 'finalState', String ) ],64		709 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],65		734 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],66		735 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],67		736 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],68		751 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],69		755 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],70		756 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ],71		757 : [ ( 'location', Position ), ( 'name', String ), ( 'target', String ), ( 'pool', String ), ( 'finalState', String ), ( 'jointType', String ) ]...

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.